text stringlengths 454 608k | url stringlengths 17 896 | dump stringclasses 91 values | source stringclasses 1 value | word_count int64 101 114k | flesch_reading_ease float64 50 104 |
|---|---|---|---|---|---|
Running Python in the Linux Kernel
This article will talk about a cool project I’ve worked on recently — a full Python interpreter running inside the Linux kernel, allowing:
- Seamless kernel APIs calls
- Global variables access
- Python syntax sugar for reading & writing kernel structures
- Kernel-core-into-Python callbacks (“Python function pointers”)
- Kernel function hooking (via kprobes & ftrace)
- Python-based kernel threads
And everything’s dynamic, with a REPL running in the kernel.
If you just wanna try it, then you can jump to the end of the article for usage instructions. In the rest of this post I’ll share how this idea came about, what were the challenges building it, etc.
But first, I’ll give you a few examples of what it’s capable of.
>>> printk("so.. %s %d %d %d\n", "hello", 123, None, True)
18
>>> # in dmesg: "so.. hello 123 0 1"
This small snippet will print all files opened on the system (by all processes and by the kernel itself):
# kernel_ffi has functions to interop with the kernel
from kernel_ffi import ftrace, str as s# filename_s is now a function that "casts" pointers to the kernel's "struct filename"
filename_s = partial_struct("filename")# "orig" is a callable pointer, to call the real do_filp_open.
def do_filp_open_hook(orig, dfd, pathname, op):
fn = filename_s(pathname)
# fn is a "struct filename" object, and we can access its fields
# use "s" to read the name pointer to a Python string
fn_str = s(int(fn.name))
print("do_filp_open on {!r}".format(fn_str))
# finally, call the original with the same arguments. we
# could modify them if we wanted.
return orig(dfd, pathname, op)ft = ftrace("do_filp_open", do_filp_open_hook)# remove when you're done. if you forget, it'll be removed when the
# object is garbage-collected.
ft.rm()
This snippet will “change” the contents of
/dev/null :
file_operations = partial_struct("file_operations")
# I can reference null_fops without previously defining it -
# all missing globals are resolved using the kernel symbols.
null_fops = file_operations(null_fops)from kernel_ffi import callbackdef my_read_null(file, buf, count, ppos):
pos = p64(ppos)
b = b"who said /dev/null must be empty?\n"[pos:]
l = min(len(b), count)
memcpy(buf, b, l)
p64(ppos, pos + l)
return lc = callback(my_read_null)
# calls to null_fops.read will call our callback instead.
null_fops.read = c.ptr()
Why?
I’ve had experience developing both user-mode and kernel-mode software. User-mode environments have a great advantage when we talk about the ease of development; The development community is huge, we have tons of examples online, and many dev tools are ready at hand. You also have many tools and scripting languages to help you with prototyping. Even when your code-base is written in a low level language like C, you can experiment with user-mode ideas in a faster prototyping environment, like Python.
You don’t get that in kernel development. There are tons of APIs, much less documentation and no feasible way of prototyping besides recompiling your code, reloading it and trying to measure (let’s face it, we all just
printk) the differences. Needless to say that you pay badly for mistaking, since many of them will crash your kernel.
I got the idea that being able to easily prototype API calls, access variables and monitor kernel functions behavior, might be useful. A more dynamic language will do well, and a REPL will be very nice.
There are tons¹ of dynamic-patching kernel tools, but I didn’t know of one providing a dynamic REPL, and in a convenient manner. And what would be more convenient than Python?
Basically what I had in mind is a fusion of Frida (providing hooks, because I realized hooks will also be useful) and a Python REPL (providing easy inspection and interaction with objects and functions).
Here’s a real-life example from this week, showing this need of a REPL: I wrote something based on the kernel’s
rw_semaphore , in one function I had the read lock taken and I needed to write. The concept of “upgradable RW locks” — atomically converting a read lock to a writer lock — is well known, so I thought a quick search online would yield a result as for whether it’s possible or not. I couldn’t find anything, neither in the docs (the .h file).
A quick check in the REPL would be enough! So I headed to the terminal tab I keep open with a REPL on some QEMU VM, and typed the following:
>>> from kernel_ffi import kmalloc
>>> from struct_access import sizeof
>>>
>>> p = kmalloc(sizeof("rw_semaphore"))
>>> __init_rwsem(p)
>>>
>>> down_read(p)
>>> # yeah, can lock twice
>>> down_read(p)
>>>
>>> down_write_trylock(p)
0 # makes sense, i guess
>>> down_write(p)
# hangs forever!
Back to the story. I’ve had some experience with MicroPython, which is a complete Python 3 interpreter intended for microcontrollers. I’ve been using it on various chips like the ESP32 and ESP8266 for a while, and I decided it won’t be too troublesome to port it to the Linux kernel, since unlike CPython, MicroPython wasn’t designed to be run (only) in usermode. It wasn’t designed to run in the Linux kernel either, but it makes much less assumptions about its environment, and that’s why it is easier to get it running on a new “platform”.
Some challenges
Some issues and designs I have encountered during development.
Struct Access
The kernel code defines and uses thousands of complex structures. I wanted this tool to provide human-friendly struct accessing, not address-based like “read an integer at address XX”, “write a byte at address YY”.
So, for a struct like
struct net_device *dev, what’s required to provide accessors like
dev->stats.rx_dropped?
The first thing is some Python syntax magic for the dereferences, array accesses, etc. It’s quite cool behind the scenes, but I won’t talk about that.
The second thing, and the more interesting one, is how does the Python get to know the structure layout?
When compiling a kernel module (that uses structures), you are required to have the kernel headers and configuration. The compiler reads the definitions from them. Can we parse those headers and extract structure definitions as well?
There are a few C structure parsing libraries in Python, for example cstruct and dissect.cstruct. But if you have had a look at a complex kernel structure, you’d know these approaches won’t “just work” — the struct definitions make very extensive use of
#ifdefs based on configurations, specific alignment requirements like
__cacheline_aligned_in_smp,² not to mention
__randomize_layout …³ My point is, it will be very hard to parse it correctly for someone who’s not the compiler actually building it.
Who’s else doing it, though? Debuggers. GDB allows you to print structs and access structs field. How do debuggers do it?
The DWARF debugging format (embedded in ELF files when you compile with
-g) can encode struct definitions. That’s what debuggers use, and also how the useful pahole tool does its tricks. There’s even also a Python implementation that does more or less the same.
At this point, I thought that relying of DWARF requires the target code to be recompiled with debug info. Now I can say it’s true. Anyway, I went ahead with the solution I had mind…
I decided I had to follow the way GCC extracts structs, and what’s the best way to do so if not from the inside of GCC itself? Time to write a GCC plugin.
So I found a simple example of a GCC plugin and did what developers do the best — take existing code they don’t fully understand, run it, modify it a little, run it again and learn from what’s changed. Shortly after I had a fully functioning plugin that you can load during your compilation, and it’ll dump all defined structs in as nice Pythonic objects. I named it struct_layout (just like the DRAWF parsing Python project I mentioned earlier) and you can find it on github.
So all you have to do is to include the headers you want into an empty C file, and compile with the plugin.
In hindsight, I could do similarly with DWARF… ;) Just compile an empty C file including the relevant headers, and read the dwarf output in the
.o file.
But I’m happy with my choice. Writing a GCC plugin was a great experience I encourage all developers to take on themselves. It was sure more fun than parsing the DWARF section.
The rest was simple. As I said earlier, with a bit of Python magic you can easily wrap those definitions with objects that’ll allow the nice syntax sugar mimicking how it looks in C code.
>>> d = net_device(dev_get_by_name(init_net, "eth0"))
>>> # so this accesses the net_device's
>>> # "struct net_device_stats stats" field, and
>>> # then accesses "unsigned long rx_bytes"
>>> d.stats.rx_bytes
15158
And since it’s Python and everything’s dynamic, it also comes with a few cool features, like tab completion for fields and basic protection from NULL dereferences, array out-of-bounds access, unsigned/signed overflow detection and more. Neat!
Multi-threading
MicroPython supports multi-threading out-of-the-box, you just have to give it some basic primitives (like locks) and a TLS (thread-local storage), and you need to hack a GC implementation that takes all threads into account.
TLS implementations in usermode vary. For
x86, for example, you can
clone a new thread with
CLONE_SETTLS and the kernel will make sure that whenever your thread runs, it’ll have the
fs register pointing to your specified data structure. Other basic possible implementation can be to use the bottom/top of the stack for storage. That’s the kernel implementation for
current_thread_info in many architectures — for example, for ARM:
static inline struct thread_info *current_thread_info(void)
{
return (struct thread_info *) (current_stack_pointer & ~(THREAD_SIZE - 1));
}
These methods are useful when you control the thread — that is, you create it, you control the entry point, and so on. But what if you’re a callback in another thread, or just hooking onto some code which is to be run by threads you don’t control? You can’t use these tricks — you might interfere with the owner of the thread who’s using the same method.
So, you can just select one of the unused methods (
x86 doesn’t use the top of the stack — or the bottom, I can’t recall — so it’s free for your use) but since I needed to maintain the list of threads currently executing Python (we’ll see later why) I went with a more naive implementation — making use of the existing thread-based struct
current, I keep a list of
task_struct s to their TLS info. Then you can always get the TLS for
current.
The next major component that needs special treatment when multi-threading is the garbage collector— MicroPython uses a mark & sweep garbage collector:
In mark & sweep, no object references are maintained, and when the GC runs it needs to scan the entire program memory (or, at least the relevant areas) for pointers into the heap. Heap blocks that are referenced are marked, and are added to the scan queue, recursively. All blocks still unmarked when the scan queue is empty are considered garbage and are freed.
Mark & sweep has the advantage of simpler code (no reference counting, no freeing, you just
malloc stuff and everything works). But the requirement to “scan the entire program memory” is… impossible in the kernel. For example, the Python makes partial of the kernel heap. Do we need to scan the heap as well? It might be huge!
But we just need to make sure all the pointers into the heap are scanned… If we never place root pointers — pointers that no other object refers to — globally, but only on stacks of threads executing Python, then this scan can be narrowed down to the stacks of these threads, which is simple enough to do.
Using the list of threads we kept for TLS, we can get the stack start & end pointers of the relevant threads. The stack start can be narrowed to the “stack start when Python started” — if there’s a kernel stack containing 10 frames, and then a Python hook was called, we don’t need to scan those 10 previous frames. Care must be taken to use the right stack start, even for a thread with nested Python calls (that is, a Python hook calling kernel code that’s again hooked by Python). And since there’s no feasible way to get the current stack pointer for a thread currently running on another CPU, we’ll just use the real stack end.
Combining these, the GC is deterministic enough and safe enough to run, even from kernel hooks, which is quite cool.
Threading support is not complete and I still get crashes from time to time, but it’s not something that can’t be debugged and eliminated.
And’s that’s enough talking for this post. Onward to the real thing!
MicroPython for the Linux Kernel
Use it on your own risk! This is definitely not production ready. Whatever you try using it should be tried using a VM beforehand. And if you need such a dynamic tool for production use, I suggest you to use one of the tools mentioned in the footnotes¹.
(Though it mostly works and I managed to happily run it on my physical PC… :))
Compiling
$ # point KDIR to the kernel headers you're compiling for.
$ # if building for the locally running kernel, you can skip this step.
$ export KDIR=/path/to/the/kernel/
$ # get structs_layout, it'll be built as a part of micropython.
$ git clone
$ # build python:
$ git clone --depth 1 -b linux-kernel
$ cd micropython
$ make -C mpy-cross
$ make -C ports/linux-kernel STRUCT_LAYOUT=1
The resulting module
ports/linux-kernel/build/mpy.ko can be loaded with a plain
insmod /
modprobe .
You can get a REPL with
socat file:`tty`,raw,echo=0,escape=0xc tcp:<IP>:9999 (use Ctrl+D/Ctrl+L to break out from this shell).
For more examples and general help, you can refer to the README.
I’ve tested it on QEMU+KVM with kernels 4.4, 5.0, 5.2. 5.3, 5.4. I’ve also tested it on my physical laptop (Ubuntu 18.04, kernel 5.0) and my Arch Linux (kernel 5.4).
That’s all. I hope you enjoyed the reading, and that you find this tool useful :)
[1]: To name a few: SystemTap, eBPF, perf, kprobe events, ftrace, kplugs (which is somewhat similar to this project…)
[2]:
__cacheline_aligned attributes ensure data items are aligned to the size of a cacheline. This is usually used when different items in a struct tend to be written concurrently by different CPUs. By ensuring “items of different CPUs” don’t cross into the same cacheline, cache flushes can be avoided. A classic example is the
ptr_ring struct which has separate cachelines for “producer” items, “consumer” items and shared items.
[3]:
__randomize_layout attributes marks a struct definition as applicable for struct layout randomization, which is a very cool obfuscation technique employed to make kernel exploits harder. Read this lwn article to learn more about it. | https://medium.com/@yon.goldschmidt/running-python-in-the-linux-kernel-7cbcbd44503c | CC-MAIN-2020-50 | refinedweb | 2,550 | 59.53 |
Using Custom Themes
Smartface.
This documentation cover the technical implementations of themes. If you also need an example based documentation, refer to class documentation here:Using Style and Classes
When You Will Need Themes
If you want to use any component on other projects, you don't need to set its properties one by one each time. Just define a class under your theme, set your style properties once, then use it multiple times!
How To Use Themes"
}
Style File Template
Under the styles folder there are style files defined for each component. These files must be in JSON format. If you end up with an invalid file, an error popup will be generated to guide you.
Properties must be always on above of class names. If not classes can not be inherited the properties below.
size, bold, italic, family
Class Names.
Exporting User Properties
Rules"
}
Adding a rule
-.
Phone:
Tablet:
Variables.
Sample variables file
It is nothing more than a key value mapping. Values are treated as variables.
{
"black": "rgba(0,0,0,1.0)",
"white": "#FFFFFF",
"backgroundMain": "#00A1F1",
"genericImage": "smartface.png"
}
Usage
Instead of setting hardcoded styles from your styles file, use variables. See the sample button.json file:
{
".sf-button": {
"backgroundColor": "${backgroundMain}",
"textColor": "${white}",
"width": 100,
"height": 50,
}
}
Theme Inheritance.
Inheritance with variables
It is possible to have themes with only variables. That way, you can set your styles on the parent theme, allowing theme switch to be easier.
With this approach, your app will have a base theme and may have lots of simple themes to support different themes. And this way, adding a new theme becomes surprisingly easy!
Type of variables must be string. Other than string types are not supported currently such as boolean, number.
Here is a little sample to demonstrate the usage:
- Light Theme
- Dark Theme
- Style Usage
- Theme Inheritance
"backgroundMain": "#FFFFFF",
"backgroundSecondary": "#FEFEFE",
"boxColor": "rgba(255,255,255,1.0)",
"genericImage": "smartface.png",
"navbar": "rgba(34,34,34,1.0)",
"mainTextColor": "rgba(245,245,245, 1.0)"
"backgroundMain": "rgba(40,85,172,1.0)",
"backgroundSecondary": "#656565",
"boxColor": "rgba(28,28,28,1.0)",
"genericImage": "icon.png"
"navbar": "rgba(55,55,55, 1.0)",
"mainTextColor": "rgba(189,189,189,1.0)"
{
".buttonRegular": {
"backgroundColor": "${backgroundMain}",
"textColor": "${mainTextColor}",
"width": 100,
"height": 50,
}
}
{
"Paths": {
"defaults": "/styles/defaults",
"pages": "/styles/pages",
"components": "/styles/components"
},
"parent": "lightTheme"
}
See when you inherit a theme, define your styles on the parent theme just for once then the only thing to do for theming is declaring variables to be used in those styles for each theme. This way your styling experience will get super easy and consistent across your project.
Using Themes Programmatically
Creating theme context is handled in your theme.ts file just like;
Switching Between Themes
import Button from '@smartface/native/ui/button';
import { themeService } from 'theme';
myButton.on('press', () => {
// "Style1" is new theme to be switched to
themeService.changeTheme("Style1");
})
The above code is showing a simple way to change your theme on the run, but to make it more robust there are a few things to watch out for. Let's have a look at them and improve our code accordingly.
ThemeService.changeThemefunction is executed on main thread, therefore it is sync.
To prevent this we can set a timeout for the function call. Let's have a look at the code now:
import Button from '@smartface/native/ui/button';
import { themeService } from 'theme';
myButton.on('press', () => {
setTimeout(() => {
themeService.changeTheme("Style1");
}, 100);
})
This way your theme switching will be executed 100 ms after the button is pressed. During that time if you want users to be aware that they pressed the button properly, you may place a loading sign before and after the code. This will also help you to prevent users' multiple press actions sequentially on the button so you won't need to worry about it. To learn more about screen-wide loading signs you can refer to:Dialog
Keeping the users' preferred theme on device storage is a good practice.
To decide which theme to be used on the app's startup for the user's choice, keeping the last used theme or the user's favorite theme on the device's storage would be a good option. Let's see how to achieve this on the code:
import Button from '@smartface/native/ui/button';
import { themeService } from 'theme';
import Data from '@smartface/native/global/data';
myButton.on('press', () => {
setTimeout(() => {
const currentTheme = Data.getStringVariable("currentTheme");
// Assume that we only have two themes to be switched to,
// and switch to the other theme whenever the button is clicked.
const targetTheme = currentTheme === 'lightTheme' ? 'darkTheme' : 'lightTheme';
themeService.changeTheme(targetTheme);
Data.setStringVariable("currentTheme", targetTheme);
}, 100);
})
To achieve keeping the current theme on the device's local storage we have used
Data. To learn more about this you can refer to:
While using the
currentTheme as the key for the Data module, since scripts/theme.ts file uses this key by default to get the preferred theme choice on the app's startup we also configured which theme to be used when the app starts running.
If you want to use a different key for storing current theme info on the Data module, don't forget to change the one used in the scripts/theme.ts file as well.
Changing styles in the runtime
In runtime, it is possible to set classes to components due to some conditioning. Please see example below.
if (state === "active") {
myButton.dispatch({
type: "pushClassNames",
classNames: ".item.active"
});
} else {
myButton.dispatch({
type: "removeClassName",
class.
Reacting to theme changes
To programmatically act on a theme change,
themeService.onChange function does the trick for you.
Changing bottom tabbar colors on theme change
To do this, in the place where you define your BottomTabBarRouter you can define an onChange event for theme service, and change the style of bottomTabBar accordingly. Let's see the usage:
import BottomTabBarController from '@smartface/native/ui/bottomtabbarcontroller';
import { themeService } from 'theme';
import { BottomTabBarRouter } from '@smartface/router';
themeService.onChange(() => {
const { backgroundColor, itemColor } = themeService.getNativeStyle('.tabs');
const rootController = bottomTabBarRouter._renderer._rootController;
if (rootController instanceof BottomTabBarController) {
rootController.tabBar.backgroundColor = backgroundColor;
rootController.tabBar.itemColor = itemColor;
}
});
const bottomTabBarRouter = BottomTabBarRouter.of({
// ... rest of your code
})
Style File Management
Class names created by user will be saved on different files performing following steps:
- Get root of class name (For example root of .button-small is button)
- If root denotes a
smartface/nativecomponent a
smartface/nativecomponent.
Advanced:
- Typescript
import { createSFCoreProp } from "@smartface/styling-context/lib/sfCorePropFactory";
page.dispatch(
type: "addChild",
{
subscribeContext: function (e) {
if (e.rawStyle.backgroundColor) {
// Get color object
const backgroundColor = createSFCoreProp(
"backgroundColor",
e.rawStyle.backgroundColor
);
}
},
},
".flexLayout"
);
- Do not call dispatch before onLoad method of page is called. (For example in constructor it cannot be called)
- defaults property of the Library components no longer exists
For more information and advanced usage please refer to the Contxjs documentation
Limitations
Currently iOS and Android specific properties cannot be set by the style files. | https://docs.smartface.io/7.0.1/smartface-ide/using-themes-in-apps/ | CC-MAIN-2022-40 | refinedweb | 1,152 | 58.58 |
/* Header file for unwinding stack frames for exception handling. */ /* Compile this one with gcc. */ /* Copyright (C) 1997, 1998 Free Software Foundation, Inc. Contributed by Jason Merrill <jason. */ typedef struct frame_state { void *cfa; void *eh_ptr; long cfa_offset; long args_size; long reg_or_offset[FIRST_PSEUDO_REGISTER+1]; unsigned short cfa_reg; unsigned short retaddr_column; char saved[FIRST_PSEUDO_REGISTER+1]; } frame_state; /* Values for 'saved' above. */ #define REG_UNSAVED 0 #define REG_SAVED_OFFSET 1 #define REG_SAVED_REG 2 /* The representation for an "object" to be searched for frame unwind info. For targets with named sections, one object is an executable or shared library; for other targets, one object is one translation unit. A copy of this structure declaration is printed by collect2.c; keep the copies synchronized! */ struct object { void *pc_begin; void *pc_end; struct dwarf_fde *fde_begin; struct dwarf_fde **fde_array; size_t count; struct object *next; #ifdef FRAME_SECTION_DESCRIPTOR FRAME_SECTION_DESCRIPTOR #endif }; /* Note the following routines are exported interfaces from libgcc; do not change these interfaces. Instead create new interfaces. Also note references to these functions may be made weak in files where they are referenced. */ extern void __register_frame (void * ); extern void __register_frame_table (void *); extern void __deregister_frame (void *); /* Called either from crtbegin.o or a static constructor to register the unwind info for an object or translation unit, respectively. */ extern void __register_frame_info (void *, struct object *); /* Similar, but BEGIN is actually a pointer to a table of unwind entries for different translation units. Called from the file generated by collect2. */ extern void __register_frame_info_table (void *, struct object *); /* Called from crtend.o to deregister the unwind info for an object. */ extern void *__deregister_frame_info (void *); /* Called from __throw to find the registers to restore for a given PC_TARGET. The caller should allocate a local variable of `struct frame_state' (declared in frame.h) and pass its address to STATE_IN. Returns NULL on failure, otherwise returns STATE_IN. */ extern struct frame_state *__frame_state_for (void *, struct frame_state *); | http://opensource.apple.com//source/gcc/gcc-926/gcc/frame.h | CC-MAIN-2016-44 | refinedweb | 302 | 50.02 |
0
I'm having a little problem. The challenge is this: "Modify the program so that different shapes are drawn at each angle rather than a small filled circle".
So I'm trying to change the middle shape when the second hand hits 12, 3, 6, and 9. I've got some code, but it's not working. It's randomizing everything when it hits the 12, 3, 6, and 9 numbers. I know why this is, it's becasuse the loop is iterating much faster than the second hand is moving, so once it's on those numbers, it will change the shapes for 1 second.
I just don't know what to do, I'm sorry if that's a terrible explanation. Here's my code:
At the bottom, under '#randomize the middle object' is the part I'm stuck at. I'd be very greatful if someone could help!
import sys, random, math, pygame from pygame.locals import * from datetime import datetime, date, time def print_text(font, x, y, text, color=(255,255,255)): imgText = font.render(text, True, color) screen.blit(imgText, (x,y)) def wrap_angle(angle): return angle % 360 def draw_middle(shape): if shape == 'rect': pygame.draw.rect(screen, white, (pos_x, pos_y, 100, 100)) elif shape == 'circle': pygame.draw.circle(screen, white, (pos_x, pos_y), 20) elif shape == 'ellipse': pygame.draw.ellipse(screen, white, (pos_x, pos_y, 100, 100)) #main program begins pygame.init() screen = pygame.display.set_mode((600,500)) pygame.display.set_caption("Analog Clock Demo") font = pygame.font.Font(None, 36) orange = 220,180,0 white = 255,255,255 yellow = 255,255,0 pink = 255,100,100 pos_x = 300 pos_y = 250 radius = 250 angle = 360 #repeating loop while True: for event in pygame.event.get(): if event.type == QUIT: sys.exit() keys = pygame.key.get_pressed() if keys[K_ESCAPE]: sys.exit() screen.fill((0,0,100)) #draw one step around the circle pygame.draw.circle(screen, white, (pos_x, pos_y), radius, 6) #draw the clock numbers 1-12 for n in range(1, 13): angle = math.radians(n*(360/12) - 90) x = math.cos(angle) * (radius - 20) - 10 y = math.sin(angle) * (radius- 20) - 10 print_text(font, pos_x + x, pos_y + y, str(n)) #get the time of the day today = datetime.today() hours = today.hour % 12 minutes = today.minute seconds = today.second #draw the hours hand hour_angle = wrap_angle(hours * (360/12)-90) hour_angle = math.radians(hour_angle) hour_x = math.cos(hour_angle) * (radius-80) hour_y = math.sin(hour_angle) * (radius-80) target = (pos_x + hour_x, pos_y + hour_y) pygame.draw.line(screen, pink, (pos_x, pos_y), target, 25) #draw the minutes hand min_angle = wrap_angle(minutes * (360/60)-90) min_angle = math.radians(min_angle) min_x = math.cos(min_angle) * (radius-60) min_y = math.sin(min_angle) * (radius-60) target = (pos_x + min_x, pos_y + min_y) pygame.draw.line(screen, orange, (pos_x, pos_y), target, 12) #draw the seconds hand sec_angle = wrap_angle(seconds * (360/60) - 90) sec_angle_rad = math.radians(sec_angle) sec_x = math.cos(sec_angle_rad ) * (radius-40) sec_y = math.sin(sec_angle_rad ) * (radius-40) target = (pos_x + sec_x, pos_y + sec_y) pygame.draw.line(screen, yellow, (pos_x, pos_y), target, 6) #randomize the middle object numbers = [0, 90, 180, 270, 360] shapes = ['ellipse', 'circle', 'rect'] choice = random.choice(shapes) draw_middle(choice) print_text(font, 0, 0, str(hours) + ":" + str(minutes) + ":" + str(seconds)) pygame.display.update() | https://www.daniweb.com/programming/software-development/threads/441240/how-to-randomize-one-thing-in-a-loop | CC-MAIN-2017-04 | refinedweb | 537 | 62.34 |
Many Methods & Instances
by, January 29th, 2012 at 04:52 PM (389 Views)
This post goes over how we can use multiple methods in different classes. It's a very inefficient program we've written, but it's designed to show you exactly what each method does and how they relate to each other. Here's Class2, the guts of the application. I've included comments to show you what everything does.
public class Class2 { //New string private String friendName; /* This method is responsible for collecting the name * variable we sent from the main method. We assign * the variable friendName to the name collected in * the main method. */ public void setName(String name){ friendName=name; } //New method with a return type of String public String getName(){ /* Basically just inserts the friendName variable * into the getName method.*/ return friendName; } //New method for finally outputting our name variable public void outputName(){ //Outputs the variable getName System.out.printf("Your friend's name is %s", getName()); } }
The application basically outputs someone's name which we collect from Class1. Basically, we start by creating a friendName variable that we can use in Class2. It's going to be responsible for carrying our friend's name throughout the series of methods we've created here. Our first method, setName assigns the variable name (sent from Class1) to our friendName variable.
The next method, which is pretty useless, simply assigns the variable of friendName to the method of getName. This way we can use it in our last method, outputName by simply calling the getName method (which is storing our friendName variable). Let's take a look at Class1.
class Class1{ public static void main(String args[]){ //New object for Class2 Class2 class2Object = new Class2(); //New string String name = "Tony"; //Send the variable 'name' to setName method in Class2 class2Object.setName(name); //Run the outputName method in Class2 class2Object.outputName(); } }
All we're doing here is creating a new object for Class2, followed by creating our name string, followed by sending this variable via our object through to the setName method in Class2.
I know it seems stupid using four different methods to output a simple variable, but it shows us how we can use multiple methods with multiple purposes for each to get the job done. Obviously this sort of setup would be better used had we had many more operations we wished to carry out. | http://www.javaprogrammingforums.com/blogs/oa-od-jd1/47-many-methods-instances.html | CC-MAIN-2016-07 | refinedweb | 401 | 60.65 |
Web scraping is a technique of extracting information from websites. In this article we will learn the basics of web scraping with Python using the "requests" and "BeautifulSoup" packages.
Web scraping is a technique of extracting information from websites. In this article we will learn the basics of web scraping with Python using the "requests" and "BeautifulSoup" packages.
Table of Contents
What is web scraping all about?
Imagine that one day, out of the blue, you find yourself thinking “Gee, I wonder who the five most popular mathematicians are?”
You do a bit of thinking, and you get the idea to use Wikipedia’s XTools to measure the popularity of a mathematician by equating popularity with pageviews. For example, look at the page on Henri Poincaré. There, you can see that Poincaré’s pageviews for the last 60 days are, as of December 2017, around 32,000.
Next, you Google “famous mathematicians” and find this resource that lists 100 names. Now you have a page listing mathematicians’ names as well as a website that provides information about how “popular” that mathematician is. Now what?
This is where Python *and *web scraping come in. Web scraping is about downloading structured data from the web, selecting some of that data, and passing along what you selected to another process.
In this tutorial, you will be writing a Python program that downloads the list of 100 *mathematicians *and their *XTools *pages, selects data about their popularity, and finishes by telling us the top 5 most popular mathematicians of all time! Let’s get started.
Important: We’ve received an email from an XTools maintainer informing us that scraping XTools is harmful and that automation *APIs *should be used instead:
This article on your site is essentially a guide to scraping XTools […] This is not necessary, and it’s causing problems for us. We have APIs that should be used for automation, and furthermore, for pageviews specifically folks should be using the official pageviews API. The example code in the article was modified to no longer make requests to the XTools website. The web scraping techniques demonstrated here are still valid, but please do not use them on web pages of the XTools project. Use the provided automation API instead.
You will be using Python 3 and Python virtual environments *throughout the *tutorial. Feel free to set things up however you like. Here is how I tend to do it:
$ python3 -m venv venv $ . ./venv/bin/activate
You will need to install only these two packages:
Let’s install these dependencies with
pip:
$ pip install requests BeautifulSoup4
Finally, if you want to follow along, fire up your favorite text editor and create a file called
mathematicians.py. Get started by including these
import statements at the top:
from requests import get from requests.exceptions import RequestException from contextlib import closing from bs4 import BeautifulSoup
Your first task will be to download web pages. The
requests package comes to the rescue. It aims to be an easy-to-use tool for doing all things HTTP *in *Python, and it doesn’t dissappoint. In this tutorial, you will need only the
requests.get() function, but you should definitely checkout the full documentation when you want to go further.
First, here’s your function:
def simple_get(url): """ Attempts to get the content at `url` by making an HTTP GET request. If the content-type of response is some kind of HTML/XML, return the text content, otherwise return None. """ try: with closing(get(url, stream=True)) as resp: if is_good_response(resp): return resp.content else: return None except RequestException as e: log_error('Error during requests to {0} : {1}'.format(url, str(e))) return None def is_good_response(resp): """ Returns True if the response seems to be HTML, False otherwise. """ content_type = resp.headers['Content-Type'].lower() return (resp.status_code == 200 and content_type is not None and content_type.find('html') > -1) def log_error(e): """ It is always a good idea to log errors. This function just prints them, but you can make it do anything. """ print(e)
The
simple_get() function accepts a single
url argument. It then makes a
GET request to that URL. If nothing goes wrong, you end up with the raw HTML content for the page you requested. If there were any problems with your request (like the URL is bad, or the remote server is down), then your function returns
None.
You may have noticed the use of the
closing() function in your definition of
simple_get(). The
closing() function ensures that any network resources are freed when they go out of scope in that
with block. Using
closing() like that is good practice and helps to prevent fatal errors and network timeouts.
You can test
simple_get() like this:
>>> from mathematicians import simple_get >>> raw_html = simple_get('') >>> len(raw_html) 33878 >>> no_html = simple_get('') >>> no_html is None True
Once you have raw HTML in front of you, you can start to select and extract. For this purpose, you will be using
BeautifulSoup. The
BeautifulSoup constructor parses raw HTML strings and produces an object that mirrors the HTML document’s structure. The object includes a slew of methods to select, view, and manipulate DOM nodes and text content.
Consider the following quick and contrived example of an HTML document:
<!DOCTYPE html> <html> <head> <title>Contrived Example</title> </head> <body> <p id="eggman"> I am the egg man </p> <p id="walrus"> I am the walrus </p> </body> </html>
If the above HTML is saved in the file
contrived.html, then you can use
BeautifulSoup like this:
>>> from bs4 import BeautifulSoup >>> raw_html = open('contrived.html').read() >>> html = BeautifulSoup(raw_html, 'html.parser') >>> for p in html.select('p'): ... if p['id'] == 'walrus': ... print(p.text) 'I am the walrus'
Breaking down the example, you first parse the raw HTML by passing it to the
BeautifulSoup constructor.
BeautifulSoup accepts multiple back-end parsers, but the standard back-end is
'html.parser', which you supply here as the second argument. (If you neglect to supply that
'html.parser', then the code will still work, but you will see a warning print to your screen.)
The
select() method on your
html object lets you use CSS selectors to locate elements in the document. In the above case,
html.select('p') returns a list of paragraph elements. Each
p has HTML attributes that you can access like a
dict. In the line
if p['id'] == 'walrus', for example, you check if the
id attribute is equal to the string
'walrus', which corresponds to
<p id="walrus"> in the HTML.
Now that you have given the
select() method in
BeautifulSoup a short test drive, how do you find out what to supply to
select()? The fastest way is to step out of Python and into your web browser’s developer tools. You can use your browser to examine the document in some detail. I usually look for
id or
class element attributes or any other information that uniquely identifies the information I want to extract.
To make matters concrete, turn to the list of mathematicians you saw earlier. If you spend a minute or two looking at this page’s source, you can see that each mathematician’s name appears inside the text content of an
<li> tag. To make matters even simpler,
<li> tags on this page seem to contain nothing but names of mathematicians.
Here’s a quick look with Python:
>>> raw_html = simple_get('') >>> html = BeautifulSoup(raw_html, 'html.parser') >>> for i, li in enumerate(html.select('li')): print(i, li.text) 0 Isaac Newton Archimedes Carl F. Gauss Leonhard Euler Bernhard Riemann 1 Archimedes Carl F. Gauss Leonhard Euler Bernhard Riemann 2 Carl F. Gauss Leonhard Euler Bernhard Riemann 3 Leonhard Euler Bernhard Riemann 4 Bernhard Riemann # 5 ... and many more...
The above experiment shows that some of the
<li> elements contain multiple names separated by newline characters, while others contain just a single name. With this information in mind, you can write your function to extract a single list of names:
def get_names(): """ Downloads the page where the list of mathematicians is found and returns a list of strings, one per mathematician """ url = '' response = simple_get(url) if response is not None: html = BeautifulSoup(response, 'html.parser') names = set() for li in html.select('li'): for name in li.text.split('\n'): if len(name) > 0: names.add(name.strip()) return list(names) # Raise an exception if we failed to get any data from the url raise Exception('Error retrieving contents at {}'.format(url))
The
get_names() function downloads the page and iterates over the
<li> elements, picking out each name that occurs. Next, you add each name to a Python
set, which ensures that you don’t end up with duplicate names. Finally, you convert the set to a list and return it.
Nice, you’re nearly done! Now that you have a list of names, you need to pick out the pageviews for each one. The function you write is similar to the function you made to get the list of names, only now you supply a name and pick out an integer value from the page.
Again, you should first check out an example page in your browser’s developer tools. It looks as if the text appears inside an
<a> element, and the
href attribute of that element always contains the string
'latest-60' as a substring. That’s all the information you need to write your function:
def get_hits_on_name(name): """ Accepts a `name` of a mathematician and returns the number of hits that mathematician's Wikipedia page received in the last 60 days, as an `int` """ # url_root is a template string that is used to build a URL. url_root = 'URL_REMOVED_SEE_NOTICE_AT_START_OF_ARTICLE' response = simple_get(url_root.format(name)) if response is not None: html = BeautifulSoup(response, 'html.parser') hit_link = [a for a in html.select('a') if a['href'].find('latest-60') > -1] if len(hit_link) > 0: # Strip commas link_text = hit_link[0].text.replace(',', '') try: # Convert to integer return int(link_text) except: log_error("couldn't parse {} as an `int`".format(link_text)) log_error('No pageviews found for {}'.format(name)) return None
You have reached a point where you can finally find out which mathematician is most beloved by the public! The plan is simple:
Simple, right? Well, there’s one thing that hasn’t been mentioned yet: errors.
Working with real-world data is messy, and trying to force messy data into a uniform shape will invariably result in the occasional error jumping in to mess with your nice clean vision of how things ought to be. Ideally, you would like to keep track of errors when they occur in order to get a better sense of the of quality your data.
For your present purposes, you will track instances in which you could not find a popularity score for a given mathematician’s name. At the end of the script, you will print a message showing the number of mathematicians who were left out of the rankings.
Here’s the code:
if __name__ == '__main__': print('Getting the list of names....') names = get_names() print('... done.\n') results = [] print('Getting stats for each name....') for name in names: try: hits = get_hits_on_name(name) if hits is None: hits = -1 results.append((hits, name)) except: results.append((-1, name)) log_error('error encountered while processing ' '{}, skipping'.format(name)) print('... done.\n') results.sort() results.reverse() if len(results) > 5: top_marks = results[:5] else: top_marks = results print('\nThe most popular mathematicians are:\n') for (mark, mathematician) in top_marks: print('{} with {} pageviews'.format(mathematician, mark)) no_results = len([res for res in results if res[0] == -1]) print('\nBut we did not find results for ' '{} mathematicians on the list'.format(no_results))
That’s it!
When you run the script, you should see at the following report:
The most popular mathematicians are: Albert Einstein with 1089615 pageviews Isaac Newton with 581612 pageviews Srinivasa Ramanujan with 407141 pageviews Aristotle with 399480 pageviews Galileo Galilei with 375321 pageviews But we did not find results for 19 mathematicians on our list
Web scraping is a big field, and you have just finished a brief tour of that field, using Python as you guide. You can get pretty far using just
requests and
BeautifulSoup, but as you followed along, you may have come up with few questions:. | https://morioh.com/p/5d5665971b10 | CC-MAIN-2020-16 | refinedweb | 2,047 | 64 |
Code covered by the BSD License
4.69697
by
Dirk-Jan Kroon
31 Jan 2011
(Updated
06 Jun 2013)
Microsoft Kinect, OpenNI wrapper, Skeleton, Depth
|
Watch this File
This zip-file contains c++ wrapper functions for the Microsoft Kinect, OpenNI 1.* and OpenNI 2.* libary.
This code is compatible with Matlab 32bit and 64bit, Windows, MacOs and Linux.
Note!, OpenNI 2.* only depth/video stream support.
To compile the code to mex-files use the Microsoft Visual Studio (Express) or MacOS/Linux Gcc (x64/x86) C++ compiler.
To use OpenNI version 1.* install:
- OpenNI 1.5.4.0
- NITE 1.5.2.21
- SensorKinect093 v5.1.2.1
To use OpenNI version 2.* install:
- OpenNI 2.2.0
- NITE 2.2.0
- Microsoft KinectSDK v1.7
Start Matlab, go to OpenNi1 or OpenNI2 and execute compile_cpp_files. Now the mex-files are ready to use.
- Example : Will load an recorded Kinect file, and show the depth and image movie.
- ExampleIR : Will connect to your Kinect Hardware, and show a high-res IR image.
- ExampleRS : Will show the difference between the IR reference and measurement, Depth of a ROI is equal to movement of the ROI between reference and measurement. This depth can be calculated using a horizontal "tilt and scaling" invariant normalized cross correlation (included version is not invariant).
- ExampleSK : Will show Skeleton tracking on recorded Kinect movie.
- ExampleRW: Will show a depth surface overlay-ed with the photo-camera stream in real-world coordinates (mm)
- ExampleCP : Will capture the Kinect streams to a file
This file inspired Kinect Nite Point Viewer Matlab, Mx Ni Real World2 Pixel (An Addition To The Kinect/Open Ni/Nite Wrapper Of D.Kroon)), Simulink For Pcv (Point Cloud Viewer), Simulink Support For Kinect, and Matlab Wrapper For Open Ni 2.2.
Hi, Is it possible to get the depth image registered with the RGB image (or viceversa)?
I have a few questions:
1) What is the difference between OpenNI1 and 2?
2) How do I change the Picture Size?
3) Why are mxNiSkeleton and other missing in OpenNi2?
Yes, Microsoft KinectSDK v1.8 works as well.
Does it work with Microsoft KinectSDK v1.8?
Hello,
I successfully compiled the compile_cpp_file but when i run the Example.m, i got this error :-
Attempt to execute SCRIPT mxNiCreateContext as a function:
C:\Users\zg834397\Documents\MATLAB\kinect_matlab\OpenNI1\Mex\mxNiCreateContext.m
Error in Example (line 6)
KinectHandles = mxNiCreateContext(SAMPLE_XML_PATH,filename);
Could someone help me?
Thank you
I noticed atleast one person who got the following error:
mxNiChangeDepthViewPoint.cpp:3:22: fatal error: XnOpenNI.h: No such file or directory
compilation terminated.
mex: compile of ' "mxNiChangeDepthViewPoint.cpp"' failed.
??? Error using ==> mex at 222
Unable to complete successfully.
Error in ==> compile_cpp_files at 51
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude
''],Filename);
I'm compiling on ubuntu 12.04, with Matlab2010a. I've installed openni, nite and sensor kinect (it seems to be working on those samples with kinect). I changed compile_cpp_files.m lines 49 and 51 as stated in the last comment in that file.
If anyone has a hint why this is happening, please respond. Thank you in advance
I've been happily using this for a while now and recently noticed that mxNiStopCapture doesn't actually stop my recordings (although mxNiDeleteContext does).
That is, if I continue to loop mxNiUpdateContext after having called mxNiStopCapture, new data will continue to be added to the recording.
Has anyone else had this issue?
@SonerUlun have you tried turning on and off again? am running this in windows-64bit with OpenNI2 and I am able to compile the associated mex files. I am running into the following error when I try to run a pre-recorded oni file :
***********************************
Error using mxNiPhoto:
No Video Node in Kinect Context
***********************************
Any pointers regarding this ?
hi, i used the openni2 example.m. The depth image's size is 320, 240. How can i change it to 640, 480. i tried to change it in SamplesConfig.xml, but it did not work...
Hi,
When I use ExampleSk it runs fine but when video stops Matlab crashes and i need to restart it. Is it same for anyone else ??
hello,
i am using OpenNI version 2 , i am compiling correctly compile_cpp_files , but when i compile Example.m
this error appear ;
After initialization:
SimpleViewer: Device open failed:
DeviceOpen using default: no devices found
you can help me
thank you very much
Hello,
I have solved this problem. If I change the parameters 'xRes="1280" yRes="1024" FPS="15"' in the file SamplesIRConfig.xml into 'xRes="640" yRes="480" FPS="30"', then it works.
Hello,
when i use ExampleIR.m , the IR-picture shows so much noise. And sections of rows shift a lot. There are many strips. I have not found where the problem is.
Hi,
I am having these problems to read .oni files and .xml files.
>> KinectHandles = mxNiCreateContext('SamplesConfig.xml');
One or more of the following nodes could not be enumerated:
Error using mxNiCreateContext
Kinect Error
>>KinectHandles = mxNiCreateContext('SamplesConfig.xml','SkelShort.oni');
Can't open recordin SkelShort.oni: Can't create any node of the requested type!
Error using mxNiCreateContext
Kinect Error
What can I do to solve that?
Thanks.
i am using OpenNI version 2. and i have install properly all three software in my system
- OpenNI 2.2.0
- NITE 2.2.0
- Microsoft KinectSDK v1.7
But while i am compiling compile_cpp_files with openNI2 path address like compile_cpp_files ('C:\Program Files\OpenNI2')
it is saying ??? Error: File: compile_cpp_files.m Line: 1 Column: 28
Unexpected MATLAB expression. i am not getting what unexpected matlab expression i have used anyone can provide me solution for that
and i am using VS 2010 professional compiler and 2011b MATLAB
To use this toolbox, use compile_cpp_files('C:\Progra~1\OpenNI2\') and not compile_cpp_files('C:\Progra~1\OpenNI2') or compile_cpp_files('C:\Program Files\OpenNI2\')
Otherwise, it works great.
Note that the Kinect is directly supported since R2013a if you have the image acquisition toolbox
I have question regarding the purchase of Kinect. Do I have to buy the Kinect for windows, to connect and run the programs, or Kinect for XBox will do the same stuff?
Please help me as soon as possible.
Thanks for the programs.
I use the mxNiChangeDepthViewPoint(KinectHandles) to align depth and color images, its working fine if I'm online streaming using the Kinect device, but if I used a .oni file I the two images are not aligned, could anyone please advise me how to fix it as I don't have a fulltime access to a Kinect device.
Many Thanks for your kind assistance and support,
How is the real world depth information actually calculated?
hello i am student of emu university master degree and my thesis about gaze tracking and i want to use kinect could you please give me some guide about your software
Anyone tried to compile with openNI 2.1.0 for MacoOSX-x64? I get this error:
mex: compile of ' "mxNiChangeDepthViewPoint.cpp"' failed.
Error using mex (line 206)
Unable to complete successfully.
Error in compile_cpp_files (line 39)
mex('-v',['-DMX_COMPAT_32_OFF -L'
OpenNiPathLib],'/Users/standard/Documents/OpenNI-2.1.0/Redist/libOpenNI2.dylib',['-I'
OpenNiPathInclude],Filename);
Hi Rusty Buts,...
you should set the Current Folder in Matlab to the folder 'Kinect_Matlab_version1f'. In my case: MYDOCUMENTS\MATLAB\Kinect_Matlab_version1f\
You will see the files contained in such folder and the subfolders Config; Example; Mex.
Good luck
help, i get this error when i try to run compile_cpp_files.m :
Error using cd
Cannot CD to Mex (Name is nonexistent or not a directory).
Error in compile_cpp_files (line 47)
cd('Mex');
am i supposed to replace the word 'Mex' with some directory? thanks
Works great with Matlab 2012b and OpenNI x64 bits on Windows7 professional.
Great work!
Do these functions support multiple senosr? (e.g. two kinect or two xtion sensors) If so, how to use mulitple sensors?
Can't get compile_cpp_files to work. I have VS2010 installed and mex works with most packages. Any advice? I apprecite.
Does anybody understands the function mxNiChangeDepthViewPoint.m?
I don't and there's no example using it...
Everything is working on Ubuntu 12.04 and MATLAB r2012b thanks to Ujwal's turtorial
Hi all,
I had this package working great on a Windows 7 computer running a 32-bit version of Matlab.
Then, all of a sudden, Matlab could not connect to the Kinect, giving the error "Nodes could not be enumerated..."
I reinstalled the drivers, reinstalled Matlab, made sure that firewall and security settings had not changed (all off), etc. I can't figure out why all of a sudden its not working. The Kinect still connects to other interfaces like FAAST and OSCeleton. Any ideas why Matlab can't connect all of a sudden?
Thanks,
Matt
i've found this link very useful to resolve compiling problem in MacOSX Lion 10.7.5, with Matlab 2012a and Xcode 4.3.2
d to support 64bit in win7
%reset the mex
mex -setup;
%detect the version of system
try
cs = computer;
is64 = strcmp('64', cs(end-1:end));
catch
disp('Unable to detect the version of the system!');
end
if is64
disp('The system is 64bit system!');
else
disp('The system is 32bit system!')('..');
Hi! I modify a little of the code to support 64bit system in Win the code to support 64bit('..');
Does it work with Asus XtionPRO live? Thanks
Any thoughts on how to fix this error? I have all the OpenNI binaries installed
Open failed: Give Pointer to Kinect as input
??? Error using ==> mxNiSkeleton
Kinect Error
nuiCapture can export Kinect sensor data to Matlab <>
It works in my win7, with newest unstable edition of openNI:
function compile_cpp_files\');
%
%openNI64.lib
if(nargin<1)
OpenNiPathInclude=getenv('OPEN_NI_INCLUDE');
% OpenNiPathLib=getenv('OPEN_NI_LIB');
OpenNiPathLib=getenv('OPEN_NI_LIB64');
if(isempty(OpenNiPathInclude)||isempty(OpenNiPathLib))
error('OpenNI path not found, Please call the function like compile_cpp_files(''examplepath\openNI'')');
end
else
% OpenNiPathLib=[OpenNiPath 'Lib'];
% OpenNiPathInclude=[OpenNiPath 'Include'];
OpenNiPathLib= fullfile(OpenNiPath, 'Lib64');
OpenNiPathInclude= fullfile(OpenNiPath, 'Include');
end
cd('Mex');
files=dir('*.cpp');
for i=1:length(files)
Filename=files(i).name;
clear(Filename);
% mex('-v',['-L' OpenNiPathLib],'-lOpenNI',['-I' OpenNiPathInclude],Filename);
mex('-v',['-L' OpenNiPathLib],'-lopenNI64',['-I' OpenNiPathInclude],Filename);
%mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude],Filename);
end
cd('..');
Thanks for this code. I'm having difficulty getting it to work.
Please can I ask, does it work with Kinect XBOX 360 or just Kinect for Windows?
Mac OSX 10.7 & Matlab 2012a
1) Install OPENNI, SENSORKINECT, NITE by following these detailed instructions:
2) Run compile_cpp_files(sPath_OPENNI), where sPath_OPENNI is the path to OpenNI on your drive.
I have a problem please help me, I using Matlab 2012a Windows7 x64 compile and test program to found
Invalid MEX-file 'C:\MATLAB\filenamexxx.mexw64': The
specified module could not be found.
thanks
I was having issues installing this on Mac OS X 10.7.4 (11E53), MATLAB R2011a 64-bit. I have the latest version of Xcode installed at the time (4.3.3).
The exact error I was having can be found at.
In order to solve this, I first changed compile_cpp_files as directed by Tim earlier (changing OpenNiPathInclude and OpenNiPathLib, modifying the mex command to build 64-bit versions).
Then, I needed to change my ~/.matlab/R2011a/mexopts.sh script on line 167 - changing SDKROOT to '/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk' instead of the (now outdated) '/Developer' location.
Nice job
thanks
Hi all,
I am having troubles with mxNiDeleteContext. When I call it, Matlab freezes on 'Busy' and there's no way to recover but with a killall.
I also tried to execute the mxNiDeleteContext in a for loop on each non-zero value of the handles vector, both in normal and in debug mode, but the situation doesn't change.
I tested it both on a Ubuntu 11.04 with Matlab R2010b and on a Ubuntu 12.04 with Matlab 2012a.
Did someone encounter similar problems? Any clue about it?
Thank you so much for your help!!!
Best
I wasn't able to capture Depth and RGB using all resolution of my ASUS Xtion Pro Live (1280x1024 according to its especification).
I've changed MapOutputMode on SamplesConfig.xml to <MapOutputMode xRes="1280" yRes="1024" FPS="30"/>, but capture process aborts with:
Open failed: The value is invalid!
Check whether C:\kinect\Matlab\Config\SamplesConfig.xml is available.
Any ideas?
Many thanks,
is this working also with microsft sdk 1, not the beta version???
Just a quick note, I was able to resolve the "/usr/bin/ld: cannot find -lopenNI" issue with ubuntu 12.04 by performing the following steps:
1. Creating a symbolic link to libOpenNI.so
-> ln -s /path/to/libOpenNI.so.1.0.0 /path/to/libOpenNI.so
2. Temporary update the environmental variable path in matlab to point to openNI library and Include folder by adding the following lines to the top of the compile_cpp_files.m file:
-> setenv('OPEN_NI_LIB', '/path/to/openNI/lib');
-> setenv('OPEN_NI_INCLUDE', '/path/to/openNI/Include');
3. Changing the mex function call in the compile_cpp_files.m to refer to '-lOpenNI' instead of '-lopenNI' since the libOpenNI.so has the letter o capitalized.
Great stuff, although it took me some time to get most of it running under Windows 7, 64 bits, but got there in the end.
However, one problem I have now: my Infrared photo returns 0's only. Depth works fine, so the IR-camera should be running... Anybody else faced this problem and has a clue how to overcome it? Could it be something in the KinectHandles / XML setting? Any advice is appreciated!
Hey I keep on getting this error:
??? Error using ==> mxNiSkeleton
No User Node in Kinect Context
Error in ==> ExampleSK at 12
Pos= mxNiSkeleton(KinectHandles);
Any help please?
I managed to get the Kinect working on both my Mac and Windows now so thank you all for your aid.
However I have yet to work out a way to get the information I want from the Kinect into Matlab.
What I want is to be able to grab a set of x,y,z co-ordinates from the Kinect. At this point it doesn't matter for which body part. Hand tracker or skeleton model being the obvious options I have been trying to compile them in a way that allows a real time stream to an expanding variable...
However I am stumped and out of my depth. Any advice or help would be greatly apreshiated.
I found this to be a great contribution. However, I am facing problems when trying to detect skeleton nodes.
I am using Fedora x64 and Matlab 2011a. In my system both OpenNI and NITE are working from the command line (1.5.X versions), but in Matlab wrapper only examples not using skeleton detection are executing correctly.
When I try the ExampleSK I get the error:
If I incorporate a User node in the XML configuration file such as:
<Node type="User" name="User1"></Node>,
then the error I get when executing ExampleSK is:
??? Error using ==> mxNiCreateContext
Kinect Error 2
Error in ==> ExampleSK at 9
KinectHandle=mxNiCreateContext(SAMPLE_XML_PATH);
Please can you help me with the following error can not find the solution thank you very much:
One or more of the Following nodes not could be enumerated:
Device: PrimeSense/SensorV2/5.1.0.41: The device is not connected!
?? Error using ==> mxNiCreateContext
Error Kinect
Error in ==> ExampleIR at 5
KinectHandles = mxNiCreateContext (SAMPLE_XML_PATH);
Software: I use is: win7 64 bit matlab 2011th, visual studio c + + 2010, driver correctly detects the engine, audio and camera, and tried with stable and unstable PrimeSense is the same.
In the examples C: \ Program Files \ OpenNI \ Samples \ Bin64 \ Release shows:
Device: PrimeSense/SensorV2/5.1.0.41: The device is not connected! I do thank you.
Update to my previous post, I was eventually able to get this software to compile and run. I had to do three main things to make this work on a 64-bit version of Matlab in OS X Lion:
0. Install universal (32/64 bit) versions of Open NI libraries.
1. Provide the explicit location of the Open NI libraries to mex.
2. Tell mex to not downgraded the MX library to 32-bit
To accomplish #1 and #2 above, I made the following changes in the compile_cpp_files script:
a. OpenNiPathInclude='/usr/include/ni/';
b. OpenNiPathLib='/usr/lib';
c. mex('-v',['-DMX_COMPAT_32_OFF -L' OpenNiPathLib],'/usr/lib/libOpenNI.dylib',['-I' OpenNiPathInclude],Filename);
After that, everything just ran fine.
Having trouble with the 'compile_cpp_files' step. I'm using Mac OS X 10.7.3 with Matlab R2011b (64-bit but there's no other option for Mac I think) and Xcode 4.3. I've successfully installed all the Open NI stuff. The trouble comes when mex tries to link against Open NI:
-> gcc -O -Wl,-twolevel_namespace -undefined error -arch x86_64 -Wl,-syslibroot,/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk -mmacosx-version-min=10.5 -bundle -Wl,-exported_symbols_list,/Applications/MATLAB_R2011b.app/extern/lib/maci64/mexFunction.map -o "mxNiChangeDepthViewPoint.mexmaci64" mxNiChangeDepthViewPoint.o -L/usr/lib -lOpenNI -L/Applications/MATLAB_R2011b.app/bin/maci64 -lmx -lmex -lmat -lstdc++
ld: library not found for -lOpenNI
collect2: ld returned 1 exit status
The Open NI library is located in /usr/lib (and you can see I've provided this path to mex) and it's called libOpenNI.dylib. Does anybody know if I need to do something special because it's a dynamic library? By the way, with Xcode 4.3 I had to tell mexopts.sh where the SDKs where because they are not in the usual old place anymore.
thanks in advance for any help
T
@Charles: I got it working on Mac OSx (SL 10.6.8). I believe that the link @Thomas provides is the right solution. However, I found an easier way: I have called the compilation script with the argument of my OpenNI folder that contains Include and Lib dirs, like this
compile_cpp_files('/PathTo/OpenNI-Bin-Dev-MacOSX-v1.5.2.23/').
Note that the library starts with a capital letter, so I have changed L34 of the script to
mex('-v',['-L' OpenNiPathLib],'-lOpenNI',['-I' OpenNiPathInclude],Filename);
It compiled and linked. Then, in Example.m I needed to change the backward slashes (\) to unix-like forward slashes (/), and it worked. Hope this helps.
BTW, your snippet indicates that, despite you are on 10.7, your MATLAB mex uses 10.6 SDKs. Consider running mex -setup, and editing SDKROOT in
/Users/yourUname/.matlab/R2011b/mexopts.sh
Hi, I have got a problem. I am using Matlab 2009b. the compiler is vs2008 express.（i have vs 2010 professional, but for some reason matlab cannot detect it.）All stuff I installed are 32-bit. I compiled this code. It works fine with the saved data. But I cannot run the Kinect stream. It says
"mage: PrimeSense/SensorKinect/5.1.0.25: Xiron OS failed to connect to a network socket!
??? Error using ==> mxNiCreateContext
Kinect Error"
Please help me.
Many THanks
the skeleton tracking example seems not work when using camera stream instead of recorded video. I just uncommened
KinectHandles=mxNiCreateContext(SAMPLE_XML_PATH);
new user can be detected, but there's no message:
"Pose Psi detected for user"
"Calibration started for user" "Calibration complete, start tracking user"
Any one have tried this?
hi all,
i have win7 and 64bit matlab R2011b.
can you help me please,
i have error with compiler;
??? Error using ==> mex at 208
Unable to complete successfully.
Error in ==> compile_cpp_files at 34
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude],Filename).
thanks
Hi all, I'm hoping you can help me.
I seem to have reached a problem that was addressed earlier by Joelle but fail to understand how he managed to overcome it.
I am running Matlab R2011b on a Mac OS X Lion.
I managed to get the Kinect drivers working, proven by being able to run the samples in the NITE and OpenNI folders, however when I try to run the compile_cpp_files code I get the following error.
/Applications/MATLAB_R2011b.app/bin/mex: line 305: gcc-4.2: command not found
-> g++-4.2 -c -I/Users/charlesbartlett/Documents/Kinect_Development/OpenNI-Bin-Dev-MacOSX-v1.4.0.2Include -I/Applications/MATLAB_R2011b.app/extern/include -I/Applications/MATLAB_R2011b.app/simulink/include -DMATLAB_MEX_FILE -fno-common -no-cpp-precomp -fexceptions -arch x86_64 -isysroot /Developer/SDKs/MacOSX10.6.sdk -mmacosx-version-min=10.5 -DMX_COMPAT_32 -O2 -DNDEBUG "mxNiChangeDepthViewPoint.cpp"
/Applications/MATLAB_R2011b.app/bin/mex: line 1285: g++-4.2: command not found
Error in compile_cpp_files (line 34)
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I'
OpenNiPathInclude],Filename);
For the OpenNIPath I set it to the location I extracted the OpenNI to, so all seems well there. Thus I'm wondering if this is to do with it being a 64bit Matlab or Mac or both. But Ideally I would just like to get the skeleton example working nicely.
Many Thanks for any help you can give!!
If anypony is still having trouble using this on Mac OS X (10.7), with a "lOpenNI not found" error, have a look at this stackoverflow question:
Somehow I was hoping for all the functionality of OpenNI to be available in MATLAB via some toolbox.
I basically want to bootstrap the skeleton-tracking algorithm of OpenNI and enable it to find the tip of an object (e.g. a sword) held in the hand of the user. Is this tool good enough for that purpose or should I stick to coding in C++?
I guess if we want to use all the C++ functions of OpenNI, we have to write a C++ file the way u wrote and then bring it to MATLAB (if at all needed). Am I right or is there a better way to go about it, using your tool('..');
Does it work on Asus Xtion Pro Live? Do I need to modify any code to get it working? Thanks~
When I ran the ExampleRW.m to get the 3d motion of my object, I got a lot of "noise" as here:
<br>Does anybody got the same problem. I dont know why it happens to me.
Joelle, where did you change __int64 for long long int? Im having the same problems installing it on Mac OS with Matlab R2009b.
ld: library not found for -lOpenNI
But library libOpenNI.dylib is in the /usr/lib/ folder... so I guess it has to do with something similar as what you did.
Can some one please explain in detail how to get it running on 64 bit bit Windows machine? I have tried a lot of combinations but wasnt able to get it done.
Hi Ujwal. Thanks a lot for sharing your "how-to" document. I will give it a try.
Hi Matt! Since Paulo said that most ppl here are using windows I didn't bother putting the fix for linux. Anyways I have prepared a documentation for kinect+ubunut+matlab and put it up here:
Let us know if there is a problem.
Hi Ujwal. That's great! I would like to have access to your fix. Since other people will be interested as well, would it be possible for you to make it available here or on a public URL? Thanks!
Ujwal, I'd be really intersted in the fix as well if you don't mind sharing the wealth!
Hi Paulo, got a fix for that... at least its working for my system. I can drop you a mail if you need the fix.
Hi Ujwal. I did not find a solution for that problem yet. I have been working on a different project in the past few weeks though. I was hoping the problem would have been fixed in the recent versions of this OpenNI wrapper. But it seems most people here are using Windows.
Paulo, I tried what you had advised for ubuntu(10.10, 64bit)... the problem still persists. Was it resolved for you?
Can this tool be used to connect multiple kinects on? I guess not. Can anyone throw some light on this? Thanks!
I am trying to run the package under win7 64 bit. with XP 32bit, it works perfect with the sensor kinect v5.0.1 driver for 32 bit.
but which driver works for 64 bit?
the windows sdk doesn`t seem to work.
line 25,25 of compile_cpp_files.m I believe ought to be:
OpenNiPathLib= fullfile(OpenNiPath, 'Lib');
OpenNiPathInclude= fullfile(OpenNiPath, 'Include');
@John - Recently I conducted experiments with 4 pens mounted on a desk. The depth measurements were off by +/-1 cm or less for distances in the range of 1-2 m.
For people who want to align the depth-image with the photo-image, add the following line to the c.code. (I will add it my self in the next version)
g_DepthGenerator.GetAlternativeViewPointCap().SetViewPoint(g_Image);
Can anybody tell me how accurate the depth value retrieve from mxNiDepthRealWorld function. I must be very appreciate.
@John - Go to Config folder and open the file SamplesConfig.xml and try changing this parameter:
<MapOutputMode xRes="640" yRes="480" FPS="30"/> to 320 and 240 as you desire.
NOTE: You will probably have to do that for all "Node Types".
I ran ExampleCP.m to record rgb and depth image. How do you change the size of those images from 640 x 480 to 320 x 240?
The package works perfectly fine with 32 bit matlab! :)
I ran it on Win 7, Matlab 2011a. Followin modifications to compile_cpp_files.m were needed: 1) OpenNiPathLib=getenv('OPEN_NI_LIB64');2) mex('-v',['-L' OpenNiPathLib],'-lopenNI64',['-I' OpenNiPathInclude],Filename);
3)OpenNiPath =getenv('OPEN_NI_INSTALL_PATH64');
-----------------------------------------
I could run the examples with the videos in this package. However, when I try to feed video from the Kinect camera I get this error:
One or more of the following nodes could not be enumerated:
Device: PrimeSense/SensorV2/5.0.1.32: The device is not connected!
IR: PrimeSense/SensorV2/5.0.1.32: Can't create any node of the requested type!
My Kinect is powered on and running, I have also installed the drivers. Please kindly let me know if some else has encountered a similar problem.
Thanks
Hi, I have done every step to make it work, and in fact it did worke, but then when i try to do it again it stop working, now i have an error that looks like this: Error in ==> ExampleSK at 9
KinectHandle=mxNiCreateContext(SAMPLE_XML_PATH); Why does this happen?, how do i make it run again?, i can run the video example, but i can't run the kinect, if i use an openni example it works, so the drivers are not the issue, any idea?
hi, does this work on v2009b?
*Adam H.
for this example I guess the samplesConfig.xml is loaded in the startup process.
If you want to use IR, you have to use the samplesIRconfig.xml. It opens the IR node.
By the way, isn`t it possible to use all nodes with only one XML?
Matt, I'm using freenect as well but then we are on our own finding calibration and skeletonization code. So I would like to make this OpenNI wrapper work with Matlab in Linux.
I see you are now having problems linking to the openNI library. I believe you can fix this issue by correctly setting your LD_LIBRARY_PATH environment variable BEFORE running Matlab (I've tried using Matlab's setenv() function but it didn't work for me).
Here's what you can try from the system shell:
$ export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/usr/local/lib/openNI/
$ matlab
I don't remember now which folder has libopenNI.so, but you should make sure you point to the correct folder on the first command above.
Let's us know if this solves your problem.
~Paulo
Paulo, I didn't get much further. I edited XnPlatform.h and XnOs.h to include what they would've if they could figure my OS and now I get:
-> g++ -c -I/home/matt/kinect/OpenNI/Include -I/usr/local/MATLAB/R2010b/extern/include -I/usr/local/MATLAB/R2010b/simulink/include -DMATLAB_MEX_FILE -ansi -D_GNU_SOURCE -D_FILE_OFFSET_BITS=64 -fPIC -pthread -DMX_COMPAT_32 -O -DNDEBUG "mxNiCreateContext.cpp"
-> g++ -O -pthread -shared -m32 -Wl,--version-script,/usr/local/MATLAB/R2010b/extern/lib/glnx86/mexFunction.map -Wl,--no-undefined -o "mxNiCreateContext.mexglx" mxNiCreateContext.o -L/home/matt/kinect/OpenNI/Lib -lopenNI -Wl,-rpath-link,/usr/local/MATLAB/R2010b/bin/glnx86 -L/usr/local/MATLAB/R2010b/bin/glnx86 -lmx -lmex -lmat -lm
/usr/bin/ld: cannot find -lopenNI
collect2: ld returned 1 exit status
Which is a bit further along but still not working. In the meantime I'll get by using freenect, , but I'd much rather use this to get access to sensitivity settings and the fancy tracking functions. I plan on getting back to fiddling with this, I'll let you know if I get it going! Cheers
To complement my message above: this seems to be a problem when trying to compile in Matlab for Linux (I'm running Ubuntu 10.10).
Matt, I am having the same problem. Even when the include folders are set correctly, it seems some OpenNI symbols are not defined when compiling from within Matlab.
Thus, we end up with the unsupported platform error. Did you find a way to fix this problem?
When I run for instance ExampleSK with,
KinectHandles=mxNiCreateContext(SAMPLE_XML_PATH);
active.
I get,
Image Node : Found
Depth Node : Found
Infrared Node :Not found
User Node : Found
I assume IR node should also be found. I have tried restarting / clearing / deleting handle.
Any ideas? I am using the OpenNI drivers that came out a few days ago, could that be the problem?
I'm having some trouble compiling on ubuntu 10.10, I get the following error:
/XnPlatform.h:71: error: #error OpenNI Platform Abstraction Layer - Unsupported Platform!
and
/home/matt/kinect/OpenNI/Include/XnOS.h:52: error: #error OpenNI OS Abstraction Layer - Unsupported Platform!
I know I've got OpenNI, NITE and the drivers working because I've run the demos...
Any help would be greatly appreciated!
Thank you for this wonderful tool. I'm starting a project on object recognition (using matlab) and I wanted to use Kinect. Before finding your post, I had the idea of saving the stream of images using C++ and the freenect library to the disk so that Matlab can read it (file buffers). But you saved me the effort / efficiency.
Actually depth image returns you some values with uint16, these values are actually depth information (not in mm), you can get output of mxNiDepthRealworld coordinates in mm. Blue color is only for displaying.
how can i get depth information from the blue depth image. I need to get the distance of any pixel and the camera itself .. is there a method of color mapping and if so how can i do this with the blue image even if i change the color map to default or autumn .. there is no large color variation?
this solved my problem with compile_cpp_files error
If anyone has a good solution for:
"compile_cpp_files at 34
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude],Filename)"
While using matlab R2010b(64 bit), Without installing a 32bit version,
I'll be glad to hear it.
thanks.
Does anybody know about the compilation errors that I am getting? I am using MATLAB Version 7.1.0.246 (R14) Service Pack 3 with Microsoft Visual C/C++ 7.1.
Since nobody else is getting the rather specific compiler error I am getting, I am suspecting it is related to the specific compilers I am using. Since Matlab 7.1 does not support any compilers newer than Visual Studio .Net 2003, the options are limited.
Perhaps I need to switch to newer Matlab. Please let me know.
Thanks.
========
--> "cl "-IC:\Program Files\OpenNI\Include" -c -Zp8 -G5 -GR -W3 -DMATLAB_MEX_FILE -nologo /FoC:\DOCUME~1\msingh\LOCALS~1\Temp\mxNiCreateContext.obj -I"C:\Program Files\MATLAB71"\extern\include /MD -O2 -Oy- -DNDEBUG mxNiCreateContext.cpp"
mxNiCreateContext.cpp
C:\Program Files\OpenNI\Include\XnCppWrapper.h(4770) : warning C4002: too many actual parameters for macro 'XN_VALIDATE_NEW'
C:\Program Files\OpenNI\Include\XnCppWrapper.h(4770) : warning C4003: not enough actual parameters for macro 'XN_NEW'
C:\Program Files\OpenNI\Include\XnCppWrapper.h(4770) : error C2512: 'xn::StateChangedCallbackTranslator' : no appropriate default constructor available
C:\PROGRAM FILES\MATLAB71\BIN\MEX.PL: Error: Compile of 'mxNiCreateContext.cpp' failed.
??? Error using ==> mex
Unable to complete successfully
Yes, at last it's working for me. Though I used Matlab R2010a, VS2010 (ultimate) c++ compiler. To compile VS2010 C++ I used following link:
An easy solution on 64bits machine is to install a 32bit version of Matlab R2010b with the installer in the following path:
/bin/win32/
It's work great =)
*Pramod: mex -setup is showing following compilers-
Would you like mex to locate installed compilers [y]/n? n
Select a compiler:
[1] Intel C++ 11.1 (with Microsoft Visual C++ 2008 SP1 linker)
[2] Intel C++ 9.1 (with Microsoft Visual C++ 2005 SP1 linker)
[3] Intel Visual Fortran 11.1 (with Microsoft Visual C++ 2008 SP1 linker)
[4] Intel Visual Fortran 11.1 (with Microsoft Visual C++ 2008 Shell linker)
[5] Intel Visual Fortran 10.1 (with Microsoft Visual C++ 2005 SP1 linker)
[6] Lcc-win32 C 2.4.1
[7] Microsoft Visual C++ 6.0
[8] Microsoft Visual C++ 2005 SP1
[9] Microsoft Visual C++ 2008 Express
[10] Microsoft Visual C++ 2008 SP1
[11] Open WATCOM C++
[0] None
Compiler:
which compiler I can select, though I installed VS2010, it's not showing here.
You need to do a "mex -setup" and select VS2010 as compiler.
Hi Dirk, I'm using Win7(32), Matlab 2008b, VS2010 Ultimate. I installed unstable updated OpenNI and NITE according to your suggestion. I'm getting following error which is similar to previous posting's error.
??? Error using ==> mex at 213
Unable to complete successfully.
Error in ==> compile_cpp_files at 34
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude],Filename);
Shall I show the OpenNI installation directory in the 1st line like "function compile_cpp_files('C:\Program Files\OpenNI\')". I'm littel bit cofused here. In the 'C:\Program Files\OpenNI\Lib\' "openNI.lib" is available. Kindly help me out please.
I wanted to know how to align rgb and depth images using this interface.
* muhammad Raza
3D hand tracking is indeed possible by simply using some functionality from Primesence Nite
Hi, I am reading comments about kinect for last month, i am really interested to use it,
Dirk i need your recommendation for its application in 3D hand tracking feasible.
Please guide me, so that i can buy it.
thanks.
*Paulo
You can set the include directory of OpenNI manually (as user input to compile_cpp_files).
Has anyone here successfully compiled it on Ubuntu 10.10 (32-bit, OpenNI-1.0.0.25).
I get a bunch of compile warnings and errors, ending with:
mex: compile of ' "mxNiCreateContext.cpp"' failed.
Seems like an include directory is mis-configured.
It worked!
There a user guide for the library????
Hi,
Nice job!
Can you add an example of record into files in ONI format?
Hi, I'm trying to compile those files but i had an error (similar to Joelle's message):
I have Windows 64bits with Matlab R2010a
Can you help me?
I checked out your code, seems great, although you do have to compile stuff. Small mistake in Example.m and ExampleSK.m; you define "KinectHandle" instead of "KinectHandles"(s), when using Kinect Hardware, when you remove the %. Otherwise, it's a 5 star code once it's up. I'd say for now its better than the other code i have used for matlab before.
The problem was the __int64 which is not defined on Mac Os X. I replaced it with long long int and it worked just fine. Thank you very much for your code!
There is no OpenNI.lib file but a libOpenNI.dylib file in that folder.
*Joelle,
Is OpenNI.lib, present in the 'OpenNiPathLib' folder?
Also the OpenNI.lib file has to 32bit if you use Matlab 32.bit and visa-versa.
Thanks for the answer. I tried on Mac OS X with Matlab R2008b but I get a message error similar to Enita:
??? Error using ==> mex at 213
Unable to complete successfully.
Error in ==> compile_cpp_files at 27
mex('-v',['-L' OpenNiPathLib],'-lopenNI',['-I' OpenNiPathInclude],Filename);
Does it only work with R2010b or did someone manage to make it work on older version?
* Joelle
The code may work out-of-the-box in Mac OS X, if you give the proper-path to the library in the compile_cpp_files
* Enita
This is a bug in Matlab R2008a
* Tim Zaman,
Using the camera-interface in your link is interesting. But it will not work with skeleton-tracking and hand-detection.
Has someone adapted this for Mac OS X?
NITE-Bin-Win32-v1.3.0.18 , hi, where I can download?
I tested on Windows 7 but not work!
Hi. I've posted the full and easy installation instructions here
a special thank for c++ wrapper functions!
i have a problem to compile mex files :
??? Error using ==> mex at 207
Unable to complete successfully.
Error in ==> compile_cpp_files at 27
mex('-v',['-L' OpenNiPathLib],'-lopenNI','-lNiSampleModule',['-I' OpenNiPathInclude],Filename);
i use matlab 7.6 (R2008a) with Windows7.
Is mex compiler changed for this version ?
thx for help!
Not tested, but should be very fun :)
Don't crash but give error-message if using mxNiInfrared without IR node available.
Added Help, real-world mex code/example and fixed bug in skeleton code.
Fixed 64bit address bug
Added Mac-OS support
Added capture functions and example
Added file of John Darby to align depth-image with photo-image.
Now partly supports OpenNI 2.* | http://www.mathworks.com/matlabcentral/fileexchange/30242-kinect-matlab | CC-MAIN-2014-52 | refinedweb | 6,313 | 67.55 |
In assignments
I was worried about this time
My boss has created a source for UDP communication
Is this source receiving and transmitting at the same time?
I did not understand the meaning so much even if I looked it
It is said that it is decimal number though it must be just hexadecimal number.
using System.Collections.Generic; using UnityEngine; using System.Net; using System.Net.Sockets; using System.Threading; public class UdpSocket: MonoBehaviour { private string _MulticastAddr = "224.0.23.0";// multicast address private string _RemoteHost = "";// Sender address private int _SendPort = 3610;// send port private int _RecvPort = 3610;// receive port private UdpClient _UdpClient;// UDP private IPEndPoint _IpEndPoint;// IPEndPoint private Thread _RecvThread;// receive thread // connect public void Connect () { IPAddress grpAddr = IPAddress.Parse (_MulticastAddr); if (_IpEndPoint! = null) _IpEndPoint = null; _IpEndPoint = new IPEndPoint (grpAddr, _RecvPort); // Join a multicast group Disconnect (); _UdpClient = new UdpClient (_RecvPort); _UdpClient.JoinMulticastGroup (grpAddr); // receive thread creation _RecvThread = new Thread (ReceiveMulticastThread); _RecvThread.Start (); // send node profile notification SendNodeProfile (); } // disconnect public void Disconnect () { if (_RecvThread! = null) { _RecvThread.Abort (); _RecvThread = null; } if (_UdpClient! = null) { IPAddress grpAddr = IPAddress.Parse (_MulticastAddr); _UdpClient.DropMulticastGroup (grpAddr); _UdpClient.Close (); _UdpClient = null; } } // send node profile notification public void SendNodeProfile () { byte [] pack = BuildNodeProfileInfo (); SendPacket (pack, _MulticastAddr); } // send public void SendPacket (byte [] packet, string host) { _UdpClient.Send (packet, packet.Length, host, _SendPort); } // receive thread public void ReceiveMulticastThread () { byte [] packet; int i = 0; System.Text.StringBuilder s = new System.Text.StringBuilder (); packet = _UdpClient.Receive (ref _IpEndPoint); if (packet! = null) { // Received!s.Remove (0, s.Length); for (i = 0;i<packet.Length;i ++) { s.Append (System.Convert.ToString (packet [i], 16) .PadLeft (2, '0')); } Debug.Log (s.ToString ()); } } // Create node profile notification packet private byte [] BuildNodeProfileInfo () { byte [] pack; pack = new byte [17]; pack [0] = 0x10;// EHD1 pack [1] = 0x81;// EHD2 pack [2] = 0x00;// pack [3] = 0x01;// ID pack [4] = 0x0E;// sender "node profile class" pack [5] = 0xF0;// EOJ = 0x0E F0 01 pack [6] = 0x01;// pack [7] = 0x0E;// destination "node profile class" pack [8] = 0xF0;// EOJ = 0x0E F0 01 pack [9] = 0x01;// pack [10] = 0x73;// ESV pack [11] = 0x01;// OPC pack [12] = 0xD5;// EPC pack [13] = 0x04;// PDC pack [14] = 0x01;// EDT pack [15] = 0x05;// pack [16] = 0xFF;// pack [16] = 0x01;// return pack; } } Code
I want to send UDP communication with
Code
unity There is no error Not sent even when button is pressed First, there is no reaction. Nothing happens Probably something from the source won't work `` `Enter your language here Code Because the transmission code was delayed, it was unresponsive I thought there was something missing.
using UnityEngine;
using System.Net.Sockets;
using System.Text;
public class UDPClient: MonoBehaviour {
public string host ="224.0.23.0" ;;
public int port = 3610;
private UdpClient client;
// Use this for initialization
public void Start () {
client = new UdpClient ();
client.Connect (host, port);
}
// Update is called once per frame
public void Update () {
}
void OnGUI ()
{
if (GUI.Button (new Rect (10, 10, 100, 40),"button"))
{
byte [] dgram = Encoding.UTF8.GetBytes ("hello!");
client.Send (dgram, dgram.Length);
}
}
void OnApplicationQuit ()
{
client.Close ();
}
}
- Answer # 1
- Answer # 2
UDP is a protocol that keeps sending, nothing happens just by sending it
Let's make a receiver properly and check if it can be received.
And if you can't receive anything, something is wrong and you will be looking for something wrong
Related articles
- c # - i want to send an object from view to controller
- c # - i want to get a datatable with linq and then outer join
- c # - i want to get the value value set in the node of treeview
- i want to send dm to a specific user id with discordjs
- i want to know the order of writing c # code
- i want to get data like idictionary using linq in c #
- nodejs - i want to send a float type value via udp
- c # - serial communication between arduino and unity is not possible
- c # - in pc-microcomputer serial communication, the pc wants to receive the "data frame transmitted by the microcomputer&qu
- i want to identify the form in c # and pass the value
- i want to get the cpu usage rate in c # and display it in wpf
- c # - i want to replace the image image
- c # - i want to make a bool that can be skipped halfway
- c # - i want to control a text box on another form, but i can't
- c # - i want to use ontriggerexiting (?) like ontriggerstay
- c # - i want to keep the calculation history
- php - i want to send a post using javascript
- c # - i want to draw a line in wpf and apply an effect
- c # - i want to fire a ball forward
- c # - i want a new line every 13 characters
- c # - i want to read a txt file with unity and store it in an array
- i want to create a function to shuffle the contents of list with unity c #
- c # - i want to execute a process to delete the item text acquired in the ui display in a first-in, first-out order after a few
- c # - the elapsed time is measured with timedeltatime, but the 4th measurement value is strange
- c # - can't drag and drop objects into unity serialize field
- i want to load multiple images with resourcesload () [unity, c #]
- c # - animation to change the direction of the character (bool)
- c # - [unity] prediction line for movement of rigid body
- c # - i don't know how to resolve the error
- [c #] in unity, i want to repeatedly move the cube object to the z axis, but a variable conversion error occurs
Since the designated IP is a class D IP address, isn't it necessary to communicate by multicast?
Sender
Receiver
So I think that both the sender and receiver must join the multicast group.
(Since the source was written roughly, it has not been confirmed to work, and has not been compiled yet.)
Maybe there is an IP address of class A to C like "192.168 ~" in addition to this "224.0.23.0". I think it is necessary. | https://www.tutorialfor.com/questions-100732.htm | CC-MAIN-2020-40 | refinedweb | 996 | 57.91 |
Previously we have seen how we can implement Stack and Queues in JavaScript: it was , in my opinion, a nice exercise to illustrate how the different JavaScript functions to add an remove items of an array work, and how arrays can be used as such common data structures like Queues and Stacks.
But if you are interested in knowing the ins and outs of implementing a Stack, that post won’t be, I fear, too useful, because almost all of the interesting work is already being done under the hood.
So I though I would provide an example of how to do implement Stacks using C# so that we can talk about some of the basic concepts behind the implementation of Stacks.
Also notice that if you are simply searching for a Stack/Queue implementation to use in your projects you don’t need to implement it yourself, C# provides them already for you:
So if you feel curious about how you could implement a Stack in C#, had not Microsoft already done it for you, keep reading. At the end of our simplified version, you can go an read the source code of the Microsoft’s stack implementation to get a taste of the real thing.
Some key concepts
Before we jump into the implementation let’s have a look at some points we need to take into account.
For starters we need some kind of structure where we are going to store our values. As we did in JavaScript let’s use an array.
In the JavaScript example we simply defined an empty array, and happily pushed items at the end. Now in C# we need to specify the size of an array. Which means we need to take into account this:
- Choose a too small size and your stack will be quickly full.
- Choose a too big size and you will be unnecessarily wasting space.
- When the array is full, you can add more space by creating a bigger array, and copying the original elements in the new array. Of course that operation has its cost, so you would rather to keep this operations of expanding the array to the minimum.
- Given that your array has a fixed N length, you need to keep track of the last position occupied in the array, so that you know where to insert the next element, know how many elements are stored in the stack, knowing if the stack is empty, etc.
- Decide on a policy on Exceptions: for example, what would happen if you where to pop an element of an empty stack? You may choose to simple return a null element, but also you could throw an Exception to tell the user that an unusual situation has arised.
- What kind of objects is going to hold your stack? Usually we do not want a int Stack, or a string Stack, but a stack that can hold any kind of data.
- And last, but not least let’s think about the cost associated to the operations of the stack. As with any other kind of data structure we like low costs, when possible we like O(1) – constant – cost, at least for our more commons operations that in this case would be pop and push.
Implementation
Let ´s start by addressing the first points in the list above:
- We will create a BasicStack class with an array to store our data and an index pointing to the next free position.
- We will provide two constructors: one that creates a BasicStack with a default capacity of 30 items. Another one that allows the user to specify the desired size of the stack. Since the Stack is created empty, the variable index – pointer to the first free position in the stack – is 0.
public class BasicStack { private T[] arrayData; private const int defaultSize = 30; private int index; public BasicStack() { arrayData = new T[defaultSize]; index = 0; } public BasicStack(int size) { if (size < 0) throw new ArgumentOutOfRangeException("size", "Size must be a positive number"); arrayData = new T[size]; index = 0; } }
- Notice also we are using generics to not tie the Stack implementation to a specific type.
Now lets move to the functions to add and remove elements and to peek (check top element of the stack without actually remove it).
public T Pop() { if (index == 0) throw new InvalidOperationException("Exception: Empty stack"); return arrayData[--index]; } public T Peek() { if (index == 0) throw new InvalidOperationException("Exception: Empty stack"); return arrayData[index-1]; } public void Push(T obj) { if (index == arrayData.Length) { T[] newArray = new T[2 * arrayData.Length]; Array.Copy(arrayData, 0, newArray, 0, index); arrayData = newArray; } arrayData[index] = obj; index++; }
- To add an item to the stack we must simple store the item to the array, and update the index pointer accordingly to point to the next free position. The special case is when we try to add an item to an already full stack. In that case we have to create a new array bigger – in this particular implementation we are doubling the capacity – and we have to copy the elements of the old array to the new one.
- To remove an item from the stack – Pop funtion – we must return the last item of the stack, an update the index pointer accordingly. Notice that when the stack is empty – there are no elements in the array – we will simple throw an exception indicating that the operation is not valid because because the stack is empty.
- Peek works like removing an item of the stack, except that since we are only peeking, and not actually removing we will not update the index pointer.
Now about the cost of doing Push, Pop, and Peek. Most of the time will be quite good, since we are accessing an array – constant time – and updating the variable index. But there is once instance where the Push function can be significantly expensive: when we try to add an element to the array. In that case we will need to create a new data array, and copy the elements from the old to the new one, so we will end up with a linear cost for that particular case. Providing a constructor that allow the user to specify the size of the stack, we can reduce the occurrences of that costly operation for those instances where we know which the size of the data.
Now that we have a bare-bones stack implementation we can progressively add further functionality: for example, our stack implementation does not take into account iterating over the stack items! We can add easily that feature be implementing the IEnumerable interface as described here.
And that´s all for today, thanks for reading 🙂 ! | https://developerslogblog.wordpress.com/2019/07/23/how-to-implement-a-stack-in-c/ | CC-MAIN-2020-10 | refinedweb | 1,119 | 54.15 |
THE SQL Server Blog Spot on the Web
A short while ago I was collecting wait stat information at a client and ran across a very peculiar situation that I would like to share. Let me start by saying that for years I have coded with the understanding that when you include a system function in the SELECT list of a TSQL statement the function was evaluated once at the beginning and that same value was used for each row returned. I am talking about a statement such as this:
SELECT GETDATE(), CompanyName FROM Customers
The output expected looks like this:
2008-02-27 10:22:34.270 Alfreds Futterkiste 2008-02-27 10:22:34.270 Ana Trujillo Emparedados y helados 2008-02-27 10:22:34.270 Antonio Moreno Taquería 2008-02-27 10:22:34.270 Around the Horn 2008-02-27 10:22:34.270 Berglunds snabbköp 2008-02-27 10:22:34.270 Blauer See Delikatessen 2008-02-27 10:22:34.270 Blondesddsl père et fils 2008-02-27 10:22:34.270 Bólido Comidas preparadas
...
Please note that I am not talking about a User Defined Function or once that takes a column as an input to determine the result. In this case I am specifically referring to GETDATE(). As you can see all the datetime values are exactly the same as expected.
But what I experienced the other day was not as expected and quite concerning. What I got was for a single SELECT I received several different values for the GETDATE() column in the result set. This did not happen every time but happened enough times over a few days that I certainly took note of it. Now let me give a little more background because it was not just a SELECT. It was actually an INSERT INTO with the SELECT from a DMV. Not that any of this should matter anyway but for consistency sake let me give you the actual code (with a slight enhancement for demo purposes). I added an extra column called R_ID that is used to store the unique value of each loop and I placed the Insert in a WHILE loop so it can be exercised. In real life the Insert was only executed several times each day. The code below can be used to see if your system is experiencing this behavior or not. Depending on the version and service pack you may have a different number of Waits but in my case with Microsoft SQL Server 2005 - 9.00.3159.00 (Intel X86) I get 201 rows for each pass. I suspect the version has everything to do with this behavior. The system at the time was running an older version of SQL Server 2005 which was: 9.00.2047.00. If anyone finds that their server returns different values of GETDATE() for any iteration of the select I would really be interested in what version of SQL Server you are running. There is a LOT of code out there that relies on the value acting like a constant and having the same value in each row of a single SELECT statement. I suspect this is a bug in that particular version but who knows...
Please note that the sole purpose of the WHILE loop is just to give you a better chance of seeing the issue if it appears. We are looking for a difference in the datetime values for each instance of the SELECT only and not from loop to loop.
SET NOCOUNT ON
IF OBJECT_ID(N'[dbo].[wait_stats]',N'U') IS NULL CREATE TABLE [dbo].[wait_stats] ([R_ID] INT not null, [wait_type] nvarchar(60) not null, [waiting_tasks_count] bigint not null, [wait_time_ms] bigint not null, [max_wait_time_ms] bigint not null, [signal_wait_time_ms] bigint not null, [capture_time] datetime not null default getdate())
DECLARE @x INT SET @x = 1
WHILE @x < 100 BEGIN
INSERT INTO [dbo].[wait_stats] ([R_ID], [wait_type], [waiting_tasks_count], [wait_time_ms], [max_wait_time_ms], [signal_wait_time_ms], [capture_time]) SELECT @x, [wait_type], [waiting_tasks_count], [wait_time_ms], [max_wait_time_ms], [signal_wait_time_ms], GETDATE() FROM sys.dm_os_wait_stats
SET @x = @x + 1 END
-- Find the ones that have odd counts. If this returns any rows you had a difference in time for a single itteration.
SELECT [R_ID], COUNT(*) AS [Totals], [capture_time] FROM [dbo].[wait_stats] GROUP BY [R_ID], [capture_time] HAVING COUNT(*) <> 201
**Updates**
I have some new and very important information about this subject and chose to put it in a new blog post that can be found here:
If you would like to receive an email when updates are made to this post, please register here
RSS
How far apart are these different values?
I don't have the results anymore as I had to change their values to all be the same to get my report to work but I believe they were several milliseconds apart. They should not be even microseconds apart.
Don't know if this is of any help to you
Microsoft SQL Server 2005 - 9.00.3042.00 (Intel X86)
output first 10 rows from first query
72 201 2008-02-27 11:27:58.113
82 201 2008-02-27 11:27:58.160
16 201 2008-02-27 11:27:57.833
1 201 2008-02-27 11:27:57.037
61 201 2008-02-27 11:27:58.067
24 201 2008-02-27 11:29:29.957
92 201 2008-02-27 11:27:58.207
91 201 2008-02-27 11:29:30.330
5 201 2008-02-27 11:29:29.880
71 201 2008-02-27 11:29:30.223
second query returns nothing
sql server 2008 ctp 6 second query returns 99 rows. here are the first 10 (this is from a virtual machine BTW)
66 475 2008-02-27 08:37:38.577
27 475 2008-02-27 08:37:36.977
35 475 2008-02-27 08:37:37.327
41 475 2008-02-27 08:37:37.557
19 475 2008-02-27 08:37:36.557
92 475 2008-02-27 08:37:39.920
29 475 2008-02-27 08:37:37.057
10 475 2008-02-27 08:37:36.157
81 475 2008-02-27 08:37:39.450
25 475 2008-02-27 08:37:36.877
getdate() will return the time to nearest millisecond as each row is returned from select. If query takes multiple milliseconds to run then getdate() will faithfully report that. Try setting variable to getdate() immediately before query then use variable in query - time will then be the same on each row and will be the time the query started (it takes no time to set the variable in milliseconds)
Dennis,
Yes the times are expected to be different from Loop to Loop so what you show is normal. I didn't realize we were up to 475 wait types though:). It's only an issue if the second query with the HAVING clause returns anything. Thanks
Barry,
No it should not, that is the whole point of this. First off just for completeness it wouldn't change every ms since the lowest level of accuracy is 3.33ms. But in any case here is an example by Louis Davidson that shows the differences between GETDATE() and a UDF that returns datetime info in the same query.
use tempdb
go
create function dbo.test$wait
() returns datetime
as
begin
declare @i int set @i = 1
while @i < 10000
begin
set @i = @i + 1
end
return (getdate())
end
select getdate() AS [Getdate],dbo.test$wait() AS [UDF]
from master.sys.sysobjects
Andy,
Why would you expect the same value for every row? Is that documented in BOL? I personally expected different values for every row, like Barry mentioned, if the GETDATE() is in the SELECT list. OTOH, I expect that the same value would be used for every row if GETDATE() is in the WHERE clause. I vaguely recall verifying the SELECT list behavior in SQL Server 7.0 for a big ETL process I was working on at the time; I don't think this is a bug at all.
I expect it that way because a long time ago the MVP's were told (can't remember who it was unforntunately) that this was an optimization technique in which GEDATE() was only evaluated once at the beginning of the query instead of for each row. At this point I don't care if I am right or wrong in that regard but what I do want is for it to be consistant one way or the other. The example that Louis provided shows that it does not get evaluated for each row otherwise the times would be similar to the UDF's output since it does get evaluated for each row. Again I am OK either way but it needs to be clear which is the proper and expected behavior. In my experience over the last x many years this is the only time I have ever seen GETDATE() not return the same value. I created this blog entry for the sole purpose of brining this to light as it is very clear now that there is code out there written two ways, each expecting a different behavior.
>> I personally expected different values for every row
I remember having different values for every n rows, when importing 30k of rows from a nightly job a while back. That is why I used a variable back then because it was required that the rows had the same value
I believe the value should be constant, but need to find doc to back myself up on this one. The reason I remember it is that I have had long discussions with our DB2 guru on a similar topic and in DB2 you can actually specify which behavior you want (constant or change as the rows are evaluated).
BTW, I tried >insert junk select id, ..., getdate() from _3_million_row_table<, and there was only one dt value in the target table after all 3 million rows were inserted.
I am getting the same values also
Now I am not sure if what I said before is true maybe I was getting the same value and I needed the inserted value
select s1.id,getdate() as TheDate
into #sysobjects
from sysobjects s1 cross join sysobjects s2
cross join sysobjects s3
select min(thedate),max(thedate),count(*) from #sysobjects
drop table #sysobjects
SQL 2000
2008-02-27 14:45:41.677 2008-02-27 14:45:41.677 14706125
sql 2005
2008-02-27 14:47:46.477 2008-02-27 14:47:46.477 1191016
sql 2005 with an additional cross join (cross join sysobjects s4)
2008-02-27 14:48:31.040 2008-02-27 14:48:31.040 126247696
you can always do something like this if you want different values
create function fnThedate()
returns datetime
begin
return (getdate())
end
select dbo.fnThedate(),* from master..sysobjects s1
I agree with Andy that it *should* be evaluated only once, but I have long been using a variable as a "constant" since there was no official statement that the suddenly elusive optimization will always take place.
Kind of reminds me of SELECT * without the ORDER BY... it was undocumented but almost guaranteed behavior in older versions of SQL Server, but not anymore...
I also agree that it should either always work one way or always work the other. The repros in this thread show that the behavior is not consistent.
We always store GetDate() in a local varaible and then use that local variable in selects or stored procedures so that all of the date values are the same for that execution.
Our concern with GetDate() and dates in general is that there is no easy way to build a date apart from either constructing a text string of a date or using dateadd(). Is there any TSQL function to build a date similar to CREATEDATE(year, month, day, hour, minute, second, millisecond, local)
where each of the parameters are integers? ANSI SQL missed that one.
What you were told was correct, you are just looking at it wrong.
The GETDATE() is evaluated once for each statement. It is NOT evaluated once for each batch. You effectively have 100 insert statements in your batch, not one insert statement.
To make this more obvious, put a waitfor delay '00:00:01' before your SET @x = @x + 1 statement
If it behaved like you imply there would be no way to determine start and end time of a stored procedure from within it, since GETDATE() would evaluate to the same value at the beginning and end of the sp no matter how many milliseconds of work it had done with that particular execuation.
Nick,
The Batch or WHILE loop was simply used to make it easier for people to run this example multiple times in order to have a better chance of seeing the anomoly. It did not happen to me at the client site each time and I didn't expect it to happen for anyone testing each time either. Yes each iteration of the loop will potentially produce a different time, especially if you add a WAITFOR in there. But the times for the individual SELECTs (not Inserts since the GETDATE() is actually part of the SELECT) should remain constant. If you run the example I posted after the fact you will see this more cleary. Look for the foloow on post that has this statement in it:
In my last blog post:
I can't prove it anymore, but I seem to remember that SQL Server 7 would produce different dates. That certainly doesn't appear to be the case in these later revs. In fact, table defaults also react in the very same manner as you describe... one date per insert query. Thanks for bringing this to my attention... it doesn't really change things but it certainly seems important to know (A Developer must not guess... A Developer must KNOW --Segiy circa 2007).
Here's the code I used to test in both SQL Server 2000 sp3A (no hotfixes) and SQL Server 2005 sp2 (no hotfixes)... Since each Grouped SELECT returns only a single row, it's proof that GETDATE() was only calculated once...
--==============================================================================
--Proof that GETDATE() is only calculated once per query.
--===== Generate a table on the fly with 2 million rows of GETDATE() inserts
-- and measure/display the time it took.
DECLARE @StartTime DATETIME
SET @StartTime = GETDATE()
SELECT TOP 2000000
GETDATE() AS TheDate,
sc1.ID AS SomeColumn
INTO #MyHead
FROM Master.dbo.SysColumns sc1,
Master.dbo.SysColumns sc2
PRINT STR(DATEDIFF(ms,@StartTime,GETDATE())) +' Duration in MS'
--===== If this returns more than 1 row, there were different times.
SELECT TheDate, COUNT(*) AS TheCount
FROM #MyHead
GROUP BY TheDate
DROP TABLE #MyHead
GO
--===== This time, create a table with a default on TheDate column.
-- Do 2 million inserts letting the default populate the column and
-- measure/display the time it took.
CREATE TABLE #MyHead (TheDate DATETIME DEFAULT GETDATE(), SomeColumn INT)
INSERT INTO #MyHead
(SomeColumn)
Formatting got my post a bit... here's what I really said just before the code...
Dang formatting!!!! Words are being cutoff from the right!!! For example, I actually say "That certainly doesn't appear to be the case"... in the above, but the "n't" got cut off. If you copy and paste to Word, the missing words show up...
These items from BOL show that GETDATE is designed to get and return a new value every time it is called.
From Books On Line (SQL-Server 2005)
GETDATE is a nondeterministic function. Views and expressions that reference this column cannot be indexed.
David,
The question here is not if it is deterministic or not. Getdate() will indeed return a different value each time it is called. The question was does the function get evaluated with every row or once per set. The proper and intended behaviour is indeed once per set and not every row. This has been confirmed to be a bug and should not behaive in the manner listed above. | http://sqlblog.com/blogs/andrew_kelly/archive/2008/02/27/when-getdate-is-not-a-constant.aspx | CC-MAIN-2014-42 | refinedweb | 2,684 | 71.95 |
How to Build a Command Line Interface (CLI) Using Node.js
August 20th, 2021
What You Will Learn in This Tutorial
How to use the Commander.js library to build a command-line interface (CLI) that talks to the JSON Placeholder API.
Table of Contents
Master Websockets — Learn how to build a scalable websockets implementation and interactive UI.
Getting Started
For this tutorial, we're going to create a fresh Node.js project from scratch. We're going to assume that we're using the latest version of Node.js (v16) as of writing.
On your computer, start by creating a folder where our CLI code will live:
Terminal
mkdir jsonp
cd into the project folder and run
npm init -f to force the creation of a
package.json file for the project:
Terminal
npm init -f
With a
package.json file, next, we want to add two dependencies:
commander (the package we'll use to structure our CLI) and
node-fetch which we'll use to run HTTP requests to the JSON Placeholder API:
Terminal
npm i commander node-fetch
With our dependencies ready, finally, we want to modify our
package.json file to enable JavaScript modules support by adding the
"type": "module" property:
/package.json
{ "name": "jsonp", "type": "module", "version": "1.0.0", ... }
With that, we're ready to get started.
Adding a bin flag to your package.json
Before we close up our
package.json file, real quick we're going to jump ahead and add the
bin property which, when our package is installed, will add the specified value to our user's command line
PATH variable:
/package.json
{ "name": "jsonp", "type": "module", "version": "1.0.0", "description": "", "main": "index.js", "bin": { "jsonp": "index.js" }, "scripts": { "test": "echo \"Error: no test specified\" && exit 1" }, "keywords": [], "author": "", "license": "ISC", "dependencies": { "commander": "^8.1.0", "node-fetch": "^2.6.1" } }
Here, we set
bin to an object with a property
jsonp set to a value of
index.js. Here,
jsonp is the name that our CLI will be made accessible as
jsonp via the command line (e.g.,
$ jsonp posts). The
index.js part is pointing to the location of the script that we want to associate with that command.
Let's create that
index.js file now and start building our CLI. We'll revisit the significance of this
bin setting later in the tutorial.
Setting up the main CLI command
Fortunately, thanks to the
commander dependency we installed earlier, setting up our CLI is fairly straightforward.
/index.js
#!/usr/bin/env node import cli from "commander"; cli.description("Access the JSON Placeholder API"); cli.name("jsonp"); cli.parse(process.argv);
Getting us set up, a few different things here. First, because our script will be executed via the command line (e.g., via a
bash shell or
zsh shell), we need to add what's known as a shebang line (don't be creepy). This tells the command line through what interpreter the passed script should be run. In this case, we want our code to be interpreted by Node.js.
So, when we run this file via the command line, its code will be handed off to Node.js for interpretation. If we excluded this line, we would expect the command line to throw an error as it wouldn't understand the code.
Below this line, we dig into our actual code. First, from the
commander package we import
cli. Here, because we expect a default export (meaning no specific name is used by Commander internally for the value it exports), we import it as
cli instead of
commander to better contextualize the code in our file.
Next, we add a description and name with
.description() and
.name() respectively. Pay attention to the syntax here. While working with Commander, everything we do is built off of the main Commander instance, here, represented as
cli.
Finally, at the bottom of our file, we add a call to
cli.parse() passing in
process.argv.
process.argv is pulling in the arguments passed to the Node.js
process (the in-memory name for our script once loaded up) which are stored in the
argv property on the
process object. It's important to note that this is a Node.js concept and has nothing to do with Commander.
The Commander part is
cli.parse(). This method, like the name implies, parses the arguments passed into our script. From here, Commander takes in any arguments passed to the script and tries to interpret and match them up with commands and options in our CLI.
Though we don't expect anything to happen just yet, to test this out, in your command line,
cd into the root of the
jsonp folder we created and run
node index.js. If everything is setup correctly so far, the command should execute and return without printing anything out in the terminal.
Adding details and individual commands
Now for the interesting part. As of right now, our CLI is, well, useless. What we want to do is add individual commands that are part of the CLI that we can run or "execute" to perform some task. Again, our goal is to build a simple CLI for accessing the JSON Placeholder API. We're going to focus on three commands:
postswill retrieve a list of posts from the API, or, a single post (we'll learn how to pass an argument to our commands to make this possible).
commentswill retrieve a list of comments from the API. We'll intentionally keep this simple to show variance between our commands.
userswill retrieve a list of users from the API, or, a single user. This will behave identical to the
postscommand, just accessing a different resource on the API.
Before we add our commands, real quick, we want to add some more cli-level settings to clean up the user experience:
/index.js
#!/usr/bin/env node import cli from "commander"; cli.description("Access the JSON Placeholder API"); cli.name("jsonp"); cli.usage("<command>"); cli.addHelpCommand(false); cli.helpOption(false); cli.parse(process.argv);
Here, beneath our call to
cli.name() we've added three more settings:
cli.usage(),
cli.addHelpCommand(), and
cli.helpOption().
The first,
cli.usage(), helps us to add the usage instructions at the top of our CLI when it's invoked via the command line. For example, if we were to run
jsonp in our terminal (hypothetically speaking), we'd see a message that read something like...
Usage: jsonp <command>
Here, we're suggesting that you use the CLI by calling the
jsonp function and passing the name of a sub-command that you'd like to run from that CLI.
The
.addHelpCommand() method here is being passed
false to say we do not want Commander to add the default
help command to our CLI. This is helpful for more complex CLIs but for us, it just adds confusion.
Similarly, we also set
.helpOption() to
false to achieve the same thing, but instead of removing a help command, we remove the built-in
-h or
--help option flag.
Now, let's wire up the
posts command we hinted at above and then see how to fetch data via the JSON Placeholder API.
/index.js
#!/usr/bin/env node import cli from "commander"; import posts from "./commands/posts.js"; cli.description("Access the JSON Placeholder API"); cli.name("jsonp"); ... cli .command("posts") .argument("[postId]", "ID of post you'd like to retrieve.") .option("-p, --pretty", "Pretty-print output from the API.") .description( "Retrieve a list of all posts or one post by passing the post ID (e.g., posts 1)." ) .action(posts); cli.parse(process.argv);
Again, all modifications to our CLI are done off the main
cli object we imported from the
commander package. Here, we defined an individual command by running
cli.command(), passing the name of the command we want to define
posts. Next, using the method-chaining feature of Commander (this means we can run subsequent methods one after the next and Commander will understand it), we define an
.argument()
postId. Here, we pass two options: the name of the argument (using the
[]square bracket syntax to denote that the argument is optional—required arguments use
<>angle brackets) and a description of that argument's intent.
Next, to showcase option flags, we add
.option(), first passing the short-form and long-form versions of the flag comma-separated (here,
-p and
--pretty) and then a description for the flag. In this case,
--pretty will be used internally in the function related to our command to decide whether or not we will "pretty print" (meaning, format with two-spaces) the data we get back from the JSON Placeholder API.
To round out our command's settings, we call to
.description() adding the description we want to display when our CLI is run without a specific command (effectively a manual or "help" page).
Finally, the important part, we finish by adding
.action() and passing in the function we want to call when this command is run. Up top, we've imported a function
posts from a file in the
commands folder which we'll add now.
/commands/posts.js
import fetch from "node-fetch"; export default (postId, options) => { let url = " if (postId) { url += `/${postId}`; } fetch(url).then(async (response) => { const data = await response.json(); if (options.pretty) { return console.log(data); } return console.log(JSON.stringify(data)); }); };
To keep us moving, here, we've added the full code for our
posts command. The idea here is fairly simple. The function we're exporting will be passed two arguments:
postId if an ID was specified and
options which will be any flags like
--pretty that were passed in.
Inside of that function, we set the base URL for the
/posts endpoint on the JSON Placeholder API in the variable
url, making sure to use the
let definition so we can conditionally overwrite the value. We need to do that in the event that a
postId is passed in. If there is one, we modify the
url appending
/${postId}, giving us an updated URL like
(assuming we typed in
jsonp posts 1 on the command line).
Next, with our
url, we use the
fetch() method we imported from
node-fetch up top passing in our
url. Because we expect this call to return a JavaScript Promise, we add a
.then() method to handle the response to our request.
Handling that response, we use a JavaScript async/await pattern to
await the call to
response.json() (this converts the raw response into a JSON object) and then stores the response in our
data variable.
Next, we check to see if
options.pretty is defined (meaning when our command was run, the
-p or
--pretty flag was passed as well) and if it is, we just log the raw JSON object we just stored in
data. If
options.pretty is not passed, we call to
JSON.stringify() passing in our
data. This will get us back a compressed string version of our data.
To test this out, open up your terminal and run the following:
node index.js posts --pretty
If everything is working, you should see some data coming back from the JSON Placeholder API, pretty-printed onto screen.
[ { userId: 10, id: 99, title: 'temporibus sit alias delectus eligendi possimus magni', body: 'quo deleniti praesentium dicta non quod\n' + 'aut est molestias\n' + 'molestias et officia quis nihil\n' + 'itaque dolorem quia' }, { userId: 10, id: 100, title: 'at nam consequatur ea labore ea harum', body: 'cupiditate quo est a modi nesciunt soluta\n' + 'ipsa voluptas error itaque dicta in\n' + 'autem qui minus magnam et distinctio eum\n' + 'accusamus ratione error aut' } ]
If you remove the
--pretty flag from that command and add the number
1 (like
node index.js posts 1), you should see the condensed stringified version of a single post:
{"}
This sets up with a template for the rest of our commands. To wrap things up, let's go ahead and add those two commands (and their functions in the
/commands directory) and quickly discuss how they work.
/index.js
#!/usr/bin/env node import cli from "commander"; import posts from "./commands/posts.js"; import comments from "./commands/comments.js"; import users from "./commands/users.js"; cli.description("Access the JSON Placeholder API"); ... cli .command("posts") .argument("[postId]", "ID of post you'd like to retrieve.") .option("-p, --pretty", "Pretty-print output from the API.") .description( "Retrieve a list of all posts or one post by passing the post ID (e.g., posts 1)." ) .action(posts); cli .command("comments") .option("-p, --pretty", "Pretty-print output from the API.") .description("Retrieve a list of all comments.") .action(comments); cli .command("users") .argument("[userId]", "ID of the user you'd like to retrieve.") .option("-p, --pretty", "Pretty-print output from the API.") .description( "Retrieve a list of all users or one user by passing the user ID (e.g., users 1)." ) .action(users); cli.parse(process.argv);
To showcase multiple commands, here, we've added in two additional commands:
users. Both are set up to talk to the JSON Placeholder API in the exact same way as our
posts command.
You will notice that
users is identical to our
posts command—save for the name and description—while the
.argument(). This is intentional. We want to show off the flexibility of Commander here and show what is and isn't required.
What we learned above still applies. Methods are chained one after the next, finally culminating in a call to
.action() where we pass in the function to be called when our command is run via the command line.
Let's take a look at the
users functions now and see if we can spot any major differences:
/commands/comments.js
import fetch from "node-fetch"; export default (options) => { fetch(" async (response) => { const data = await response.json(); if (options.pretty) { return console.log(data); } return console.log(JSON.stringify(data)); } ); };
For
comments, our code is nearly identical to what we saw earlier with
posts with one minor twist: we've omitted storing the
url in a variable so we can conditionally modify it based on the arguments passed to our command (remember, we've set up
comments to not expect any arguments). Instead, we've just passed the URL for the JSON Placeholder API endpoint we want—
/comments—and then perform the exact same data handling as we did for
/commands/users.js
import fetch from "node-fetch"; export default (userId, options) => { let url = " if (userId) { url += `/${userId}`; } fetch(url).then(async (response) => { const data = await response.json(); if (options.pretty) { return console.log(data); } return console.log(JSON.stringify(data)); }); };
This should look very familiar. Here, our function for
users is identical to
posts, the only difference being the
/users on the end of our
url as opposed to
That's it! Before we wrap up, we're going to learn how to install our CLI globally on our machine so we can actually use our
jsonp command instead of having to run things with
node index.js ... like we saw above.
Globally installing your CLI for testing
Fortunately, installing our package globally on our machine is very simple. Recall that earlier, we added a field
bin to our
/package.json file. When we install our package (or a user installs it once we've published it to NPM or another package repository), NPM will take the property we set on this object and add it to the PATH variable on our (or our users) computer. Once installed, we can use this name—in this tutorial, we chose
jsonp for the name of our command—in our console.
To install our package, make sure you're
cd'd into the root of the project folder (where our
index.js file is located) and then run:
Terminal
npm i -g .
Here, we're saying "NPM, install the package located in the current directory
jsonp:
.globally on our computer." Once you run this, NPM will install the package. After that, you should have access to a new command in your console,
Terminal
jsonp posts -p
You should see the output we set up earlier in the console:
Wrapping Up
In this tutorial, we learned how to build a command line interface (CLI) using Node.js and Commander.js. We learned how to set up a barebones Node.js project, modifying the
package.json file to include a
"type": "module" field to enable JavaScript modules as well as a
bin field to specify a command to add to the
PATH variable on our computer when our package is installed.
We also learned how to use a shebang line to tell our console how to interpret our code and how to use Commander.js to define commands and point to functions that accept arguments and options. Finally, we learned how to globally install our command line tool so that we could access it via the name we provided to our
bin setting in our
package.json file.
Get the latest free JavaScript and Node.js tutorials, course announcements, and updates from CheatCode in your inbox.
No spam. Just new tutorials, course announcements, and updates from CheatCode. | https://cheatcode.co/tutorials/how-to-build-a-command-line-interface-cli-using-node-js | CC-MAIN-2022-21 | refinedweb | 2,879 | 65.12 |
Assume that we want to estimate the square root of the number three. However, after issuing the following lines of code, we would encounter an error message:
>>>sqrt(3) SyntaxError: invalid syntax >>>
The reason is that the
sqrt() function is not a built-in function. To use the
sqrt() function, we need to import the
math module first as follows:
>>>import math >>>x=math.sqrt(3) >>>round(x,4) 1.7321
To use the
sqrt() function, we have to type
math.sqrt() if we use the
import math command to upload the
math module. In addition, after issuing the command
dir(), we will see the existence of the
math module, which is the last one in the output shown as follows:
>>>dir() ['__builtins__', '__doc__', '__name__', '__package__', 'math'] ...
No credit card required | https://www.safaribooksonline.com/library/view/python-for-finance/9781783284375/ch05s02.html | CC-MAIN-2018-09 | refinedweb | 131 | 72.87 |
Hi;
I have two buttons and one function.When a user click button1 or button2 program should call the function and the function will write to the screen whic button clicked.I mean if i click button1 there will write "Button1 clicked" on the screen.All in al i want to learn how can learn that, which button called my function(i dont want more than 1 function).
Thakns.
Which GUI toolkit are you using?
With most GUI's you can pass parameters with the function call, so button 1 would use button_press("1") and button 2 would use button_press("2"). If this does not work with the graphics you are using, use a pass-through function
def button_pressed(): ##do common stuff here def button_one(): print "button one pressed" button_pressed() def button_two(): print "button two pressed" button_pressed()
Here is an example using the common Tkinter GUI toolkit ...
# Tkinter, show the button that has been clicked import Tkinter as tk def click(event): s = "clicked: " + event.widget.cget("text") root.title(s) root = tk.Tk() root.geometry("300x50+30+30") b1 = tk.Button(root, text="button1") b1.bind("<Button-1>", click) b1.pack() b2 = tk.Button(root, text="button2") b2.bind("<Button-1>", click) b2.pack() root.mainloop() ... | https://www.daniweb.com/programming/software-development/threads/99210/which-button-called-my-function | CC-MAIN-2018-13 | refinedweb | 207 | 68.26 |
Introducing DNS Database Zones
As we mentioned earlier in this chapter, a DNS zone is a portion of the DNS namespace over which a specific DNS server has authority. Within a given DNS zone there are resource records (RRs) that define the hosts and other types of information that make up the database for the zone.
You can choose from several different zone types. Understanding the characteristics of each will help you choose which is right for your organization.
The DNS zones discussed in this book are all Microsoft Windows Server 2008 zones. Non-Windows (e.g., Unix) systems set up their DNS zones differently.
In the following sections, we will ...
No credit card required | https://www.safaribooksonline.com/library/view/mcts-windows-server/9781118075432/xhtml/sec12.html | CC-MAIN-2018-26 | refinedweb | 115 | 65.62 |
In this tutorial we will check how to obtain an image from a camera and display it on a LCD, using a Sipeed M1 board and MicroPython.
Introduction
In this tutorial we will check how to obtain an image from a camera and display it on a LCD, using a Sipeed M1 board and MicroPython.
Recall from this introductory post that the Sipeed M1 module is powered by a Kendryte K210 SoC, which allows the development of computer vision applications.
The Sipeed M1 dock suit board used in these tests already ships with both peripherals: a OV2640 camera and a 2.4 inches LCD. Additionally, the board already contains connectors for both devices in the PCB, making it easy to get started without the need for soldering.
At the time of writing, the board also comes flashed with MicroPython, so we can start programming it out of the box. In case your board doesn’t have MicroPython installed, you can check here a guide on how to do it.
The code
We will start our code by importing the modules we will need. First, we will import the sensor module, which has the functionalities needed to interact with the camera.
import sensor
We will also import the lcd module, which exposes the functionalities for configuring and interacting with the display.
import lcd
After this, the first thing we will do is initializing the LCD. We will do this with a call to the init function of the lcd module.
As can be seen here, this function has some optional arguments, which have default values. Nonetheless, for our simple use case, we will not pass any parameters since the default values are enough.
lcd.init()
After this we will initialize the camera with a call to the reset function from the sensor module. This function takes no arguments.
sensor.reset()
Then we will set the frame format of the camera with a call to the set_pixformat function from the sensor module. As input, this function receives the frame format to be used.
Our camera supports the RGB565 format, which is the format recommended on the documentation.
sensor.set_pixformat(sensor.RGB565)
We also need to set the frame size, which can be done with a call to the set_framesize function. As input, the function receives the frame size to be used.
Our camera suports the QVGA size, which is the recommended one for the screen resolution we are using, as can be seen in the documentation.
sensor.set_framesize(sensor.QVGA)
To start capturing images we simply need to call the run function from the sensor module, passing as input the value 1.
sensor.run(1)
Then, to get an image from the camera, we need to call the snapshot function. This function takes no arguments and it will return as output an object of class Image.
We can pass the output of the previous function call directly to the display function of the lcd module. This function will display the image on the LCD.
lcd.display(sensor.snapshot())
To keep taking snapshots and displaying them on the LCD, we just need to send the previous command as many times as we want. The final code can be seen below.
import sensor import lcd lcd.init() sensor.reset() sensor.set_pixformat(sensor.RGB565) sensor.set_framesize(sensor.QVGA) sensor.run(1) lcd.display(sensor.snapshot())
Testing the code
To test the previous script, simply run it on your board, after having both the camera and the LCD connected.
You can use a serial tool of your choice to connect to the board and send the commands in the MicroPython prompt. In my case I’ve used uPyCraft, a MicroPython IDE. You can check here a short introduction on how to interact with the board using uPyCraft.
After running the previous commands, you should see a result similar to figure 1. As can be seen, the LCD attached to the board is displaying the image captured by the camera.
| https://techtutorialsx.com/2019/05/11/sipeed-m1-micropython-displaying-camera-image-in-lcd/ | CC-MAIN-2020-40 | refinedweb | 663 | 62.58 |
I generally encounter a predicament where "the forces that be" want a precise copy of the page in multiple places online. Instead of really duplicate this content, all I actually do is override the section within the nav that's outlined, after which range from the page. The ultimate page looks something similar to this:
<?php $top_nav_item_id = 'teen'; include('../interests/teacher-resources.php'); ?>
This typically works. I'm attempting to duplicate this for any blog category, completed in wordpress. All I appear to obtain is really a blank page, regardless of what I actually do. I have attempted the following lines:
<?php include('../blog/index.php'); include('../blog/type/teen/index.php'); include('../blog/type/teen/'); include('../blog/'); ?>
Does anybody have ideas? Is a URL spinning factor? Must i range from the template file for your particular category?
Any assistance is appreciated.
This option would be a little of the hack, however, the issue is a little of the hack to start with.
I received a great explanation of why I could not range from the website, although not any options that will work with me.
My final solution ended up being to customize the category template for your page directly. As mentioned initially, I personally use $top_nav_item_id to manage which food selection is outlined within the nav, to own appearance from the page owned by that section. Instead of override this, I merely managed to get depending on a question string. As lengthy because the user is following legit links on my small site, they'll obtain the correct query string and also have no problems.
$_Publish is disabled in Wordpress. $query_string (included in Wordpress) uses some kind of caching, and would always display as it was initially loaded.
Final solution:
if(strtolower($_SERVER['QUERY_STRING'])=='display=teen') { $top_nav_item_id = 'teen'; } else { $top_nav_item_id = 'programs'; }
Because of all who attempted to assist.
For similar issues I personally use iframes to incorporate the copy from the content. You are able to write the initial page to search for an "?embed=1" flag within the url, and just range from the embeddable content within the primary page once the embed flag exists (so that you can omit tool bars and frames that might be redundant.) Therefore the iframe src url would make use of the ?embed=1 tag to embed this content.
ini_set('display_errors', true); error_reporting(E_ALL);
No clue what is going on wrong, however it does. Maybe Wordpress aren't able to find it's atmosphere, maybe some variables are now being overrided... Really it's an awful idea to incorporate solutions like wordpress, because who knows, what global variables, functions, classes will intersect.
PS: And, incidentally, include uses file system pathways although not Web addresses.
This can be a pretty complicated subject, and something that is not very apparent from the beginning. This page should help you to get began. The bottom line is to incorporate the WordPress blog header - described around the linked page. You'll most likely likewise want to look into the WordPress Codex for assets on while using WordPress engine's API.
PHP
include needs files, not Web addresses, therefore it does not have the URL namespace uncovered by WordPress. Individuals files don't exist on-disk mod_rewrite first turns the beautiful Web addresses into an interior request to
index.php, WordPress understands that which you wanted in line with the original URL, brings a lot of stuff in the database, then creates the page. | http://codeblow.com/questions/why-can-t-i-incorporate-a-blog/ | CC-MAIN-2019-04 | refinedweb | 577 | 56.66 |
Using Raspberry Pi, Evaluate Humidity and Temperature With SI7006
Being an enthusiast for Raspberry Pi, we thought of some more spectacular experiments with it.
In this campaign, we will be measuring temperature and humidity that needs to be controlled, using a Raspberry Pi and SI7006, Humidity and Temperature sensor. So let's have a look on this journey to build a system to measure the moisture.
Step 1: Imperative Apparatus We Need
Without knowing exact parts, their value and where on earth to get them, it's really annoying. Don’t worry. We have that sorted that for you. Once you get your hands on all of the parts, the project will be as quick as Bolt in the 100m sprint.
1. Raspberry Pi
The first step was obtaining a Raspberry Pi board. The Raspberry Pi is a single-board Linux based computer. This general purpose mini PC whose little size, capabilities and low price make it viable for use in basic PC operations, modern applications like IoT, Home Automation, Smart Cities and much more.
2. I2C Shield for Raspberry Pi
In our opinion, the only thing the Raspberry Pi 2 and Pi 3 are truly lacking is an I²C port. The INPI2(I2C adapter) provides the Raspberry Pi 2/3 an I²C port for use with multiple I²C devices. It's available on ControlEverything.com.
3. SI7006 Humidity and Temperature Sensor
The Si7006 I²C Humidity and Temperature Sensor is a monolithic CMOS IC integrating humidity and temperature sensor element, an analog-to-digital converter, signal processing, calibration data, and an I²C Interface. We purchased this sensor from ControlEverything.com.
4. I2C Connecting Cable
We had the I²C connecting cable available at ControlEverything.com.
5. Micro USB cable
The least complicated, but most stringent in terms of power requirement is the Raspberry Pi! The easiest way to power the Raspberry Pi is via the Micro USB cable.
6 . Ethernet(LAN) Cable/ USB WiFi Dongle
"be strong" I whispered to my wifi signal.
Get your Raspberry Pi connected with an Ethernet(LAN) cable and plug it into your network router. Alternative, look for a WiFi adapter and use one of the USB ports to access the wireless network. It's a smart choice, easy, small and cheap !
7. HDMI Cable/Remote Access
With HDMI cable on board, you can hook it up to a digital TV or to a Monitor. Want to save money! Raspberry Pi can be remotely accessed using different methods like-SSH and Access over the Internet. You can use the PuTTY open source software.
Money often costs too much.
Step 2: Making Hardware Connections
In general, the circuit is pretty straight forward. Make the circuit as per the schematic shown. The layout is relatively simple, and you should have no problems.
In our circumspection, we revised some basics of electronics just to refurbish our memory for hardware and software. We wanted to draw up a simple electronics schematic for this project. Electronic schematics are like a blueprint for electronics. Draw up a blueprint and follow the design carefully. For further research in electronics, YouTube might hold your interest(this is key!).
Raspberry Pi and I2C Shield Connection
First of all take the Raspberry Pi and place the I²C Shield on it. Press the Shield gently. When you know what you're doing, it's a piece of cake. (See the pic above).
Sensor and Raspberry Pi Connection
Take the sensor and connect the I²C Cable to it. For best performance of this cable, please remember I²C Output ALWAYS connects to the I²C Input. The same should be done for the Raspberry Pi with the I²C shield mounted over it.
The big advantage of using the I²C Shield/Adapter and the connecting cables is that we have no wiring issues that can cause frustration and be time-consuming to fix, especially when you are not sure where to begin troubleshooting. Its a plug and play option (This is plug, unplug and play. It’s so simple to use, it’s unbelievable).
Note : The brown wire should always follow the Ground (GND) connection between the output of one device and the input of another device.
Networking is important
To make our project a success, we need an internet connection for our Raspberry Pi. For this, you have options like connecting an Ethernet(LAN) cable with the home network. Also, as an alternative but convenient way is to use a WiFi adapter. Sometimes for this, you need a driver to make it work. So prefer the one with Linux in the description.
Powering of the Circuit
Plug in the Micro USB cable into the power jack of Raspberry Pi. Power it on and we're off.
With great power comes huge electricity bill !
Connection to Screen
We can either have the HDMI cable connected to a new monitor/TV or we can we be a little bit artistic to make a remotely connected Raspberry Pi which is economical using remote access tools like-SSH and PuTTY.
Remember, even Batman has to downsize in this economy.
Step 3: Python Programming Raspberry Pi
You can view the Python Code for the Raspberry Pi and SI7006 Sensor on our Github repository.
Before getting on to the program, make sure you read the instructions given in the Readme file and Setup your Raspberry Pi according to it. It will only take a moment if you get it out of the way first.
Humidity is the amount of water vapor in the air. Water vapor is the gaseous phase of water and is invisible. Humidity indicates the likelihood of precipitation, dew, or fog. Relative humidity (abbreviated RH) is the ratio of the partial pressure of water vapor to the equilibrium vapor pressure of water at a given temperature. Relative humidity depends on temperature and the pressure of the system of interest.
Below is the python code and you can clone and edit the code in any way you prefer.
# Distributed with a free-will license.
# Use it any way you want, profit or free, provided it fits in the licenses of its associated works. # SI7006-A20 # This code is designed to work with the SI7006-A20_I2CS I2C Mini Module available from ControlEverything.com. #
import smbus import time
# Get I2C bus bus = smbus.SMBus(1)
# SI7006_A20 address, 0x40(64) # 0xF5(245) Select Relative Humidity NO HOLD MASTER mode bus.write_byte(0x40, 0xF5)
time.sleep(0.5)
# SI7006_A20 address, 0x40(64) # Read data back, 2 bytes, Humidity MSB first data0 = bus.read_byte(0x40) data1 = bus.read_byte(0x40)
# Convert the data humidity = (125.0 * (data0 * 256.0 + data1) / 65536.0) - 6.0
# SI7006_A20 address, 0x40(64) # 0xF3(243) Select temperature NO HOLD MASTER mode bus.write_byte(0x40, 0xF3)
time.sleep(0.5)
# SI7006_A20 address, 0x40(64) # Read data back, 2 bytes, Temperature MSB first data0 = bus.read_byte(0x40) data1 = bus.read_byte(0x40)
# Convert the data cTemp = (175.72 * (data0 * 256.0 + data1) / 65536.0) - 46.85 fTemp = cTemp * 1.8 + 32
# Output data to screen print "Relative Humidity is : %.2f %%RH" %humidity print "Temperature in Celsius is : %.2f C" %cTemp print "Temperature in Fahrenheit is : %.2f F" %fTemp
Step 4: Practicality Mode
Now, download (or git pull) the code and open it on the Raspberry Pi.
Run the commands to Compile and Upload the code on the terminal and see the output on the Monitor. After few moments, it will screen all the parameters. After making sure that everything works perfectly, you can improvise and move further with the project taking it into more interesting places.
Step 5: Applications and Features
The Si7006 offers an accurate, low-power, factory-calibrated digital solution ideal for measuring humidity, dew point, and temperature, in applications like HVAC/R, Thermostats/Humidistats, Respiratory Therapy, White Goods, Indoor Weather Stations, Micro-Environments/Data Centres, Automotive Climate Control And Defogging, Asset And Goods Tracking And Mobile Phones And Tablets.
For e.g. How do I like my eggs ? Umm, in a cake !
You can build a project Student Classroom Incubator, an apparatus that is used for environmental conditions, such as temperature and humidity that needs to be controlled, using a Raspberry Pi and SI7006-A20. Hatching eggs in the classroom ! It will be a gratifying and informative science project and also the first hand on experience for students to view life form in its basic. The Student Classroom Incubator is a pretty quick project to build. The following should make for a fun and successful experience for you and your students. Let’s start with the perfect equipment before we hatch eggs with the young minds.
Step 6: Conclusion
Trust this undertaking rouses further experimentation. If you've been wondering to look into the world of the Raspberry Pi, then you can amaze yourself by making used of the electronics basics, coding, designing, soldering and what not. In this process, there might be some projects that may be easy, while some may test you, challenge you. For your convenience, we have an interesting video tutorial on YouTube which might open doors for your ideas. But you can make a way and perfect it by modifying and making a creation of yours. Have Fun and explore more!
You Can Never Expect The View To Change If You Keep Looking Out Of The Same Window... | http://www.instructables.com/id/Using-Raspberry-Pi-Evaluate-Humidity-and-Temperatu/ | CC-MAIN-2017-26 | refinedweb | 1,548 | 65.83 |
Dear Twisted users,
I recently found myself implementing a design pattern that I think twisted.pb was specifically designed to address. I think I'm not using pb correctly so I'd like advice. This is a somewhat longish post because I need to describe the problem I'm trying to solve.
I have done internet searches on Stack Overflow and this list but have not found the answer to my question. If I've missed something kindly direct me to the appropriate reference.
I want to implement something functionally equivalent to a network chess game. I first consider how I would do this on a single computer with no network (maybe this is bad thinking). Each piece in the game is represented by an instance of class Agent. Each agent has a .graphics attribute which is an instance of a class from a GUI toolkit library or equivalent. Whenever an agent in the game needs to do something there will be business logic executed by the game objects proper (ie the agents) which will invoke methods on the .graphics objects to update the screen. This sort of structure seems natural as it allows easy integration of drag/drop, mouse click detection etc. It also nicely separates the real business logic from the GUI.
Now I want to run over the network. The question is how should I set up references between the client and server objects?
Surely the server will maintain a set of objects representing the pieces in the game. It seems reasonable that each user's program will have a corresponding set of objects (with .graphics attributes). The issue is, what do we mean by "corresponding" and how do these objects talk to one another? Following is my idea so far:
Each instance of AgentClient has a .server attribute which is a remote reference to an instance of AgentServer, and each instance of AgentServer has a .clients attribute which is a list of remote references to instances of AgentClient.
class AgentServer(pb.referenceable):
def remote_move(self, targetSquare): """Handle move request from client""" if self.thisMoveIsLegal(targetSquare): self.position = targetSquare for client in self.clients: client.callRemote("move", targetSquare)
def thisMoveIsLegal(self, targetSquare): <check that this is a legal move>
class AgentClient(pb.referenceable):
def requestMove(self, targetSquare): """Tell server we'd like to move""" self.server.callRemote("move", targetSquare)
def remote_move(self, targetSquare): """Server told us we moved""" self.position = targetSquare self.graphics.setNewPosition(targetSquare)
This isn't THAT bad. The client's requestMove is thin and unecessary (I put it there for illustration). Still I need to have two separate classes with corresponding methods to handle moving the piece. This seems like the kind of thing I could twisted.pb to solve more cleanly if I only would look in the right place.
This problem gets even worse when I think about how to birth new in-game objects. It would have to look like this:
class PlayerServer(pb.referenceable):
def newAgent(self, asker): """Client told us it wants a new Agent""" if self.thisIsLegal(): a = AgentServer() self.agents.append(a) for client in self.clients: d = client.callRemote("newAgent", a) d.addCallback(lambda obj: a.clients.append(obj))
class PlayerClient(bp.referenceable):
def requestNewAgent(self): """Tell the server we want to spawn a new Agent""" self.server.callRemote("newAgent", self)
def newAgent(self, serverObj): a = AgentClient() self.agents.append(a) a.server = serverObj return a
This just looks wrong. Any advice?
Thank you in advance for your help.
Regards, Daniel Sank | https://mail.python.org/archives/list/twisted@python.org/thread/JLB4U6MPTIIS5T3AL4NUXDUDQCVM6PE7/?sort=date | CC-MAIN-2022-05 | refinedweb | 586 | 60.31 |
.1 Initially, CGAL used prefix CGAL_. At the beginning of 1999, it was decided to drop prefix CGAL_ and to introduce namespace CGAL.
using CGAL::Object; Object obj; // name is now knownThere is also a statement to make all names from a namespace available in another scope, but this is a bad idea. Actually, in order not to set a bad example, we recommend not to use this in CGAL's example and demo programs.
std::cout << "Hello CGAL" << std::endl;or you have to add using declarations for the names you want to use without std:: qualification. Whenever a platform does not put names into namespace std, CGAL adds the names it needs to namespace std. This is done by the configuration tools.
As for the C-library functions, you should use the macro CGAL_CLIB_STD instead of std:
CGAL_CLIB_STD::isspace(c)
#include <something> namespace CGAL { class My_new_cgal_class {}; My_new_cgal_class my_new_function( My_new_cgal_class& ); } // namespace CGALMake sure not to have include statements nested between namespace CGAL { and } // namespace CGAL. Otherwise all names defined in the file included will be added to namespace CGAL. (Some people use the macros CGAL_BEGIN_NAMESPACE and CGAL_END_NAMESPACE in place of the namespace CGAL { and } // namespace CGAL, respectively, for better readability.)
namespace A { template <class T> const T& mix(const T& a1, const T& a2) { return a1 < a2 ? a1 : a2; } template <class T> const T& use(const T& a1, const T& a2) { return mix( a1, a2); } } // namespace A namespace B { template <class T> const T& mix(const T& a1, const T& a2) { return a2 < a1 ? a1 : a2; } double use_use( const double& t1, const double& t2) { return A::use(t1,t2); } } // namespace B int main() { B::use_use( 0.0, 1.0); return 0; }
There is a ambiguity, because both the scope enclosing the point of instantiation and the scope enclosing the point of definition contain a mix function. The mips compiler on IRIX complains about this ambiguity:
bash-2.03$ CC -64 poi.cpp
cc-1282 CC: ERROR File = poi.cpp, Line = 11
More than one instance of overloaded function "mix" matches the argument list.
Function symbol function template "B::mix(const T &, const T &)"
is ambiguous by inheritance.
Function symbol function template "A::mix(const T &, const T &)"
is ambiguous by inheritance.
The argument types are: (const double, const double).
{ return mix( a1, a2); }
^
detected during instantiation of
"const double &A::use(const double &, const double &)"
1 error detected in the compilation of "poi.cpp".
There wouldn't be any problems, if B::use_use() would be a template
function as well, because this would move the point of instantiation
into global scope.
By the way, gcc 2.95 uses the function defined at the point of definition.
Note: This section will be revised once the forthcoming revision of the C++-standard gets into a more definite state. The standard library has similar problems, e.g. for swap(), see issues 225, 226, and 229. Currently, CGAL::NTS does not exist anymore, and the CGAL_NTS macro boils down to CGAL::. As the future interface is not yet fixed, people should still follow the guidelines given below.
What are the conclusions from the previous subsection. If A plays the role of std and B the role of CGAL, we can conclude that CGAL should not define template functions that are already defined in namespace std, especially min and max. Also, letting CGAL be namespace A, we should not define templates in CGAL that are likely to conflict with templates in other namespaces (playing the role of B): Assume that both CGAL and some other namespace define an is_zero() template. Then an instantiation of some CGAL template using is_zero() that takes place inside the other namespace causes trouble. For this reason, we have another namespace NTS nested in CGAL, which contains potentially conflicting template functions.
if ( CGAL_NTS is_zero(0) ) { /* ... */ }Qualification with CGAL does not work. | http://www.cgal.org/Manual/3.3/doc_html/Developers_manual/Developers_manual/Chapter_namespaces.html | crawl-001 | refinedweb | 641 | 63.29 |
Pointers are used for exactly what you say: referring to something (data) by its location rather than by the name you choose to call it. It's a subtle difference but an important one.
There are lots of ways to use this one simple principle to accomplish lots of powerful things in C/C++. So while it may not seem like a lot, it's pretty neat. If you want specific examples of cool things pointers allow you to do, say so and I'm sure many will oblige.
pointer are used commonly for 2 reasons and of course it has more:
1-pointers are used as a 'reference':
which that mean that if we had a function and this function changes the value of a variable and we passed this variable without using pointer this will be dealing with a photo(copy) of this variable but if we used pointer we can deal with the variable in memory it self look for this example :
#include<iostream.h> void change(int a) { a+=1; } void changeptr(int * a) { *a+=1; } void main() { int a=0; int * ptr=&a; change(a); cout<<"a="<<a<<endl;//see how the value didn't change changeptr(ptr); cout<<"a="<<a<<endl;//see how the value changed becuase ew are dealing with a refrence > }
output:
a=0
a=1
2-for dynamic allocation in the memory:
that we can allocate a variable size for array using pointers with(new & delete):
and of course we use pointer to deal with C-style strings.
Edited 6 Years Ago by green-fresh: n/a
1.
For C++, I would disagree with case 1 above, in this case you want to use a reference as in:
#include <iostream> //notice no .h here void change(int a) { a+=1; } void changeref(int& a) { //notice & instead of * a+=1; //notice no leading * } int main() { //notice standard is int return for main() int a=0; change(a); cout<<"a="<<a<<endl;//see how the value didn't change changeref(a); //notice "a" directly cout<<"a="<<a<<endl;//see how the value changed because we are dealing with a reference }
2.
I agree that probably the main purpose for pointers is for dynamic allocation of memory (new & delete). However, in modern C++, especially with the new extension TR1, a much safer practice is to use smart pointers (especially the duo shared_ptr and weak_ptr).
So most of the time, references are better suited, and their main difference to pointers is that they cannot be "re-seated" in the sense that once a reference refers to some variable it can never be made to refer to something else, and they cannot refer to nothing (this is what makes them safer, but also makes (smart) pointers the only candidate for dynamic memory allocation). But now, considering smart pointers, many people now call pointers like "char*" or "int*" or whatever as C-style pointers because their role has been pushed to the realm C legacy code.
One useful purpose of (smart) pointers is to modify a unique object somewhere, like in case 1 above, but where it is more complex and thus the non-re-seatability of references become inconvenient. Also, pointers and references play a great role in static and dynamic polymorphism. One "cool" use I would say is this:
IVisibleObject* ReadVisibleObjectFromFile(const std::string& filename) { std::ifstream file(filename); int ID; file >> ID; if(ID == BOX_ID) return new CBox(file); if(ID == CYLINDER_ID) return new CCylinder(file); ... };
NOTE on the above: It is really not nice to implement this with C-style pointers like that, it should be with a boost::shared_ptr<IVisibleObject> (because the deallocator is packaged with the pointer), but this was for sake of example. | https://www.daniweb.com/programming/software-development/threads/299621/pointers | CC-MAIN-2016-50 | refinedweb | 623 | 56.83 |
Posted 17 Jul 2010
Link to this post
Posted 19 Jul 2010
Link to this post
Posted 21 Jul 2010
Link to this post
Posted 27 Jan 2012
Link to this post
Posted 30 Jan 2012
Link to this post
Nothing. Since it seems I am not alone in my frustration, could Telerik not develop some kind of script/routine that goes through to confirm everything is configured properly? Reloading a million times from scratch does not seem to help.
One thing I do that might be unique is that I have a "removeable" "D" drive containing all my data and databases that I take too and from the office. I always install my programs on my permanent "C" drive but then on my latest reload of Telerik, put it on my "D" drive. No difference.
So, in essence Telerik works perfectly in real time but not in design time.
I am happy to unload/reload again but there are residual files somewhere that never get cleansed.
Posted 02 Feb 2012
Link to this post
Posted 21 May 2015
in reply to
TechSavvySam
Link to this post
I wish I could upvote this post fifteen times. Feelin your pain Sam. When it works it's quite lovely, but then you update the version and you gotta change it in several places in the code.
Not always the most intuitive behavior and it seems like a solveable problem on their end. Considering the cost of the software, something as simple as a version update should be as intuitive as possible, without breaking the hell out of an application.
Posted 22 May 2015
Link to this post
Hi Jason,
.NET does not allow you to have several versions of the same assembly referenced at once. This is something we cannot avoid. So, when you upgrade your project with VS running, it usually would have the Design assembly from the previous version cached, and now it would have to load the next one. Hence, the conflict.
To make upgrades as easy as possible, I personally advise using the manual procedure described in the documentation:. It usually helps to clear out ASP.NET temporary files, yet this is not something a tool of ours should do because these files may be in use.
As for version numbers change - if you reference the assemblies from the BIN, this should not be an issue, especially if you use a generic tagPrefix registration like this one in the web.config:
<
pages
>
controls
add
tagPrefix
=
"telerik"
namespace
"Telerik.Web.UI"
assembly
/>
</
Regards, | http://www.telerik.com/forums/trying-to-begin-using-telerik-ajax-controls--but-assembly-version-mismatch-is-infuriating | CC-MAIN-2017-26 | refinedweb | 424 | 70.02 |
If I were designing Python's import from scratch
Or, Lessons learned from implementing import
Talk to any developer that inherits some large, old code base that has developed semantics as time has gone on and they will always have something they wished they could change about the code they inherited. After inheriting
import in Python, I too have a list of things I would love to see changed in how it works to make it a bit more sane and easier to work with. This blog post is basically a brain dump/wishlist of what I would love to see changed in import some day.
No global state
As
import currently stands, all of its state is stored in the
sys module. This makes growing the API rather painful as it means expanding a module's API surface rather than adding another attribute on an object. For me, I would rather have
import be a fully self-contained object that stored all of its own state.
This has been proposed before in PEP 406 and under the name of "import engine". It unfortunately has not gone anywhere simply due to the fact that it would take time to design the API for a fully encapsulated
import class and it doesn't buy people anything today. Now in the future it could open up some unique possibilities for
import itself -- which will be discussed later -- as well as simply be cleaner to maintain as it would allow for cleaner separation between interpreters in a single process.
Making this actually happen would occur over stages. A new
ImportEngine class would created which would define the API we wished
import would have from scratch. That API would then delegate under the hood to the
sys module so that semantics stayed the same, including making instances of the class callable and assigning such an instance to
builtins.__import__. At some point the objects that were stored in the instance of
builtins.__import__ would be set in the
sys module instead of the object delegating to the
sys module itself. After a proper amount of time, once everyone had moved over to using the object's API instead of the
sys module then we could consider cutting out the import-related parts from the
sys module.
Make
__import__ more sane
In case you didn't know, the signature for
builtins.__import__() is a bit nuts:
def __import__(name, globals=None, locals=None, fromlist=(), level=0): pass
The
locals argument isn't used. The
globals argument is only used for calculating relative imports and thus only needs
__package__ (technically
__name__ and
__path__ are also used, but only when
__package__ isn't defined and that only happens if you do something bad). The
fromlist parameter has to do with how the bytecode operates -- which I will talk about later -- and
level is just the number of leading dots in a relative import.
If I had my way, the function would be defined as:
def __import__(name, spec=None): pass
This is the almost the same signature as
importlib.import_module(), but with passing in the spec of the calling module instead of just its
__package__; nice, simple, and easy to comprehend. The only thing I might consider changing is keeping the
level argument since that is a bit of string parsing that can be done ahead of time and baked into the bytecode, but I don't know if it really would make that much of a performance difference.
You can only import modules
Having the ability to import attributes off of a module really sucks from an implementation perspective. The bytecode itself doesn't handle that bit of detail and instead hoists it upon
import. It also leads to people getting into circular import problems. Finally, it causes people to separate from afar what namespace an object belongs to which can make code easier to read by keeping the association of an object and its containing module together). Plus you can easily replace
from module import attr with
import module; attr = module.att; TOOWTDI.
So if I had my way, when you said
from foo import bar, it would mean Python did
import foo.bar; bar = foo.bar and nothing else. No more
from ... import *, no more
__all__ for modules, etc.; you wouldn't be allowed to import anything that didn't end up in
sys.modules (and I'm sure some teacher is saying "but
import * makes things easier", but in my opinion the cost of that little shortcut is too costly to keep it around). It makes thing cleaner to implement which helps eliminate edge cases. It makes code easier to analyze as you would be able to tell what modules you were after (mostly) statically. It just seems better to me both from my end in terms of implementing import and just simplifying the semantics for everyone to comprehend.
Looking up
__import__ like anything else
Like a lot of syntax in Python, the
import statement is really just syntactic sugar for calling the
builtins.__import__ function. But if we changed the semantics to follow normal name lookup instead of short-circuiting directly the
builtins namespace, some opportunities open up.
For instance, would you like to have dependencies unique to your package, e.g. have completely separate copies of your dependencies so you eliminate having to share the same dependency version with all other installed packages? Well, if you changed Python's semantics to look up
__import__ like any other object then along with the import engine idea mentioned earlier you can have a custom
sys.path and
sys.modules for your package by having a package-specific
__import__. Basically you would need a loader that injected into the module's
__dict__ its own instance of
__import__ that knew how to look up dependencies unique to the package. So you could have a
.dependencies directory directly in your package's top-level directory and have
__import__ put that at the front of its own
sys.path for handling top-level imports. That way if you needed version 1.3 of a package but other code needed 2.0 you could then put the project's 1.3 version in the
.dependencies directory and have that on your private
sys.path before
site-packages, making everything fall through. It does away with the whole explicit vendoring some projects do to lock down their dependencies.
Now I don't know how truly useful this would be. Vendoring is not hard thanks to relative imports and most projects don't seem to need it. It also complicates things as it means modules wouldn't be shared across packages and so anything that relied on object identity like an
except clause for matching caught exceptions could go south really fast (as the requests project learned the hard way). And then thanks to the
venv module and the concept of virtual environments the whole clashing dependency problem is further minimized. But since I realized this could be made possible I at least wanted to write it down. :)
I doubt any of this will ever change
While I may be able to create an object for
__import__ that people use, getting people to use that instead of the
sys module would be tough, especially thanks to not being able to detect when someone replaced the objects on
sys entirely instead of simply mutating them. Changing the signature of
__import__ would also be somewhat tough, although if an object for
__import__ was used then the bytecode could call a method on that object and then
__import__.__call__ would just be a shim for backwards-compatibility (and honestly people should not be calling or mucking with
__import__ directly anyway; use
importlib.import_module() or all of the other various hooks that
importlib provides instead). Only importing modules is basically a dead-end due to backwards-compatibility, but I may be able to make the bytecode do more of the work rather than doing it in
__import__ itself. And getting Python to follow normal lookup instead of going straight to
builtins when looking for
__import__ probably isn't worth the hassle and potential compatibility issues. | http://www.snarky.ca/if-i-were-designing-imort-from-scratch | CC-MAIN-2016-36 | refinedweb | 1,361 | 59.84 |
- Page 6
The Reference
Manual
The Adaptive Server Reference... and storing both data and logic.
* You can use the Java programming language
Database books
Database books
... of the programming interfaces for Adaptive Server Anywhere. Any client application uses... Enterprise Monitor. It
is an application programming interface that enables you
Linux and Unix Books
Linux and Unix Books
... a knowledge of Programming in C, with the knowledge necessary to write Unix programs... for programming reliable distributed systems. Protocol composition plays a central role...
E-Books: C-and-C++-books
E- Books
Collection of best ebooks available on the internet.
Browser the following list to find the books for you.
C-and-C++-books
While this book is no longer in print, it's content is still very
Linux and Unix Books page2
Linux and Unix Books page2
Network programming under Unix systems
This document is meant to provide people who already have a knowledge of Programming in C
Java & JEE books Page7
covers the MIDP device programming; but, also the full J2ME Platform. Programming:J2ME is still a "work in
progress". Often, in order to understand what... programming and J2ME application
MySQL Books
MySQL Books
List of many MySQL books.
MySQL Books
Hundreds of books and publications related to MySQL are in circulation that can help you get the most of out MySQL. These books
My Favorite Java Books
Java NotesMy Favorite Java Books
My standard book questions
When I think about textbooks and other books, I usually ask myself some questions:
Would... in a course, should I keep or throw it out?
Language
The following why we extends class MIDlet in j2me application
j2me
j2me how to compile and run j2me program at command prompt
j2me
j2me i need more points about j2me
Perl Programming Books
Perl Programming Books
... programming projects that highlight some of the moderately advances features of Perl, like... a marriage of two compatible yet unlikely partners. Extreme Programming (XP
CORBA and RMI Books
other programming books, CodeNotes drills down to the core aspects of a technology...
CORBA and RMI
Books
Client/Server Programming with Java
C/C++ Programming Books
C/C++ Programming
Books
...;
C
Programming Books
A C program... for Visual C++ 6 programming. This book skips the beginning level material and jumps in j2me i want to know how to acess third form from the second form.... so need a program for example with more thaan three
Free Java Books
Free Java Books
Sams Teach Yourself Java 2 in 24 Hours
As the author of computer books, I spend a lot...; Noble and Borders, observing the behavior of shoppers browsing through the books
j2me
j2me What is JAD file what is necesary of that
Hi Friend,
Please visit the following link:
JAD File
Thanks
Hi Friend,
Please visit the following link:
JAD File
Thanks
Java Script Programming Books
Java Script
Programming Books
... tools such as HTML have been joined by true programming
languages-including JavaScript.Now don't let the word "programming" scare you. For many
C# Programming Books
C# Programming Books
... introduction of the .NET platform, a new, exciting programming language was born. C...# is pronounced as "C sharp". It is a new programming language that enables
J2ME
J2ME i wann source code to find out the difference between two dates.. and i wan in detail.. plz do favour for me..
import java.util.... (ParseException e) {
e.printStackTrace();
}
}
}
i wann j2me code
J2ME Event Handling Example
J2ME Event Handling Example
In J2ME programming language, Event Handling are used to handle certain... screen.
As you know in J2ME there are two MIDP user interface APIs and therefore
searching books
searching books how to write a code for searching books in a library through jsp
Servlets Books
amazon.com and fatbrain.com as one of the ten best computer programming books...
Servlets Books
..., JavaServer Pages (JSP), Apache Struts, JavaServer Faces(JSF), or Java programming
Java & JEE books Page12
Java & JEE books Page12
Introduction to Programming Using
Java, Fourth Edition
Introduction to programming using java is a free, on-line textbook
Ada Books
Ada Books
The Big Online Book of Linux Ada Programming
Ada 95 is arguably...;
This book is not intended to teach you the Ada programming language. You should already
Black Berry Programming - MobileApplications
programming knowledge in j2me please provide some help thanks in advance
Text Example in J2ME
Text Example in J2ME
In J2ME programming language canvas class is used to paint and draw... a canvas class to
draw such kind of graphics in the J2ME application.
J2ME Source
JSP PDF books
JSP PDF books
Collection is jsp books in the pdf format. You can download these books
and study it offline.
The Servlets
Books Of Java - Java Beginners
Books Of Java Which Books Are Available for Short / Quick Learning
Java Reference Books
.
Java network programming books.... In this review, I'll examine a crop of books that want to be your Java network programming...
Java Reference
Books
Oracle Books
Oracle Books
... Programming
Steven Feuerstein's first book, Oracle PL/SQL Programming, has... dramatically improve your programming productivity and code quality, while
Java & JEE books Page8
Java & JEE books Page8
... with the production of software artifacts using the programming language Java, a process known... to assure its quality when it is developed.
Java is a programming language which
Tomcat Books
Tomcat Books
... of your site.
Tomcat
Works
This is one of the rare books...;
Tomcat
Books
Tomcat is an application server built around
Ask Questions?
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions. | http://www.roseindia.net/tutorialhelp/comment/95562 | CC-MAIN-2013-20 | refinedweb | 947 | 64.81 |
CodePlexProject Hosting for Open Source Software
I am having a problem getting this to work, can't delete it either.
Widget Literal not found.
c:\HostingSpaces\seniorge\tucsonbookworms.com\wwwroot\widgets\Literal\widget.ascx.cs(13): error CS0246: The type or namespace name 'WidgetBase' could not be found (are you missing a using directive or an assembly reference?)X
It sounds like you're using the "Literal" widget. In the /widgets/Literal folder is widget.ascx.cs. At the very top of that file (line # 1), add:
using App_Code.Controls;
Thank you, it works!
Are you sure you want to delete this post? You will not be able to recover it later.
Are you sure you want to delete this thread? You will not be able to recover it later. | http://blogengine.codeplex.com/discussions/238236 | CC-MAIN-2017-13 | refinedweb | 130 | 69.58 |
Working with Unit Tests in Project or Solution
Discovering unit tests in solution
For unit test management, Rider provides the Unit Tests window ( or ). Using this window, you can explore and run or debug, search tests by a substring, regroup unit tests by project, namespace, etc.
- Navigate to source code of any test or test class by double-clicking it in the view.
- run or debug selected tests.
- Create unit tests sessions from selected tests and test classs and/or add selected items to the current test session.
Running and debugging unit tests in project or solution
You can run or debug tests from the Unit Test Explorer or Solution Explorer. Unit Test Explorer gives you the advantage to see only tests and test classes, while using other windows you need to know, which projects, files, and classes contain tests.
- To execute tests from Unit Test Explorer, select the desired tests and click Run Unit Tests
/ Debug Unit Tests
on the toolbar or use the corresponding shortcuts (Ctrl+U, R / Ctrl+U, D ).
- To run or debug all tests in solution, choose in the main menu or press Ctrl+U, L.
Whatever way you choose to run or debug tests, you will see the execution progress, results, and output in the Unit Tests pressing Ctrl+U, U or choosing in the menu. | https://www.jetbrains.com/help/rider/2017.1/Unit_Testing_in_Solution.html | CC-MAIN-2021-43 | refinedweb | 222 | 66.47 |
Read this: "How to explain why multi-threading is difficult".
We need to talk. This is not that difficult.
Multi-threading is only difficult if you do it badly. There are an almost infinite number of ways to do it badly. Many magazines and bloggers have decided that the multithreading hurdle is the Next Big Thing (NBT™). We need new, fancy, expensive language and library support for this and we need it right now.
Parallel Computing is the secret to following Moore's Law. All those extra cores will go unused if we can't write multithreaded apps. And we can't write multi-threaded apps because—well—there are lots of reasons, split between ignorance and arrogance. All of which can be solved by throwing money after tools. Right?
Arrogance
One thing that makes multi-threaded applications error-prone is simple arrogance. There are lots and lots of race conditions that can arise. And folks aren't trained to think about how simple it is to have a sequence of instructions interrupted at just the wrong spot. Any sequence of "read, work, update" operations will have threads doing reads (in any order), threads doing the work (in any order) and then doing the updates in the worst possible order.
Compound "read, work, update" sequences need locks. And the locations of the locks can be obscure because we rarely think twice about reading a variable. Setting a variable is a little less confusing. Because we don't think much about reads, we fail to see the consequences of moving the read of a variable around as part of an optimization effort.
Ignorance
The best kind of lock is not a mutex or a semaphore. It surely isn't an RDBMS (but God knows, numerous organizations have used an RDBMS as a large, slow, complex and expensive message queue.)
The best kind of lock seems to be a message queue. The various concurrent elements can simply dequeue pieces of data, do their tasks and enqueue the results. It's really elegant. It has many, simple, uncoupled pieces. It can be scaled by increasing the number of threads sharing a queue.
A queue (read with an official "get") means that the reads aren't casually ignored and moved around during optimization. Further, the creation of a complex object can be done by one thread which gets pieces of data from a queue shared by multiple writers. No locking on the complex object.
Using message queues means that there's no weird race condition when getting data to start doing useful work; a get is atomic and guaranteed to have that property. Each thread gets an thread-local, thread-safe object. There's no weird race condition when passing a result on to the next step in a pipeline. It's dropped into the queue, where it's available to another thread.
Dining Philosophers
The Dining Philosophers Code Kata has a queue-based solution that's pretty cool.
A queue of Forks can be shared by the various Philosopher threads. Each Philosopher must get two Fork resources from the queue, eat, philosophize and then enqueue the two Forks again. It's quite short, easy to write and easy to demonstrate that it must work.
Perhaps the hardest thing is designing the Dining Room (also know as the Waiter, Conductor or Footman) that only allows four of the five philosophers to dine concurrently. To do this, a departing Philosopher must enqueue themselves into a "done eating" queue so that the next waiting Philosopher can be seated.
A queue-based solution is delightfully simple. 200 or so lines of code including docstrings comments so that the documentation looked nice, too.
Additional Constraints
The simplest solution uses a single queue of anonymous Forks. A common constraint is to insist that each Philosopher use only the two adjacent forks. Philosopher p can use forks (p+1 mod 5) and (p-1 mod 5).
This is pleasant to implement. The Philosopher simply dequeues a fork, checks the position, and re-enqueues it if it's a wrong fork.
FUD Factor
I think that the publicity around parallel programming and multithreaded applications is designed to create Fear, Uncertainty and Doubt (FUD™).
- Too many questions on StackOverflow seem to indicate that a slow program might magically get faster if somehow threads where involved. For programs that involve scanning the entire hard drive or downloading Wikipedia or doing a giant SQL query, the number of threads has little relevance to the real work involved. These programs are I/O bound; since threads must share the I/O resources of the containing process, multi-threading won't help.
- Too many questions on StackOverflow seem to have simple message queue solutions. But folks seem to start out using inappropriate technology. Just learn how to use a message queue. Move on.
- Too many vendors of tools (or languages) are pandering to (or creating) the FUD factor. If programmers are made suitably fearful, uncertain or doubtful, they'll lobby for spending lots of money for a language or package that "solves" the problem.
Sigh. The answer isn't software tools, it's design. Break the problem down into independent parallel tasks and feed them from message queues. Collect the results in message queues.
Some Code
class Philosopher( threading.Thread ):
"""A Philosopher. When invited to dine, they will
cycle through their standard dining loop.
- Acquire two forks from the fork Queue
- Eat for a random interval
- Release the two forks
- Philosophize for a random interval
When done, they will enqueue themselves with
the "footman" to indicate that they are leaving.
"""
def __init__( self, name, cycles=None ):
"""Create this philosopher.
:param name: the number of this philosopher.
This is used by a subclass to find the correct fork.
:param cycles: the number of cycles they will eat.
If unspecified, it's a random number, u, 4 <= u < 7
"""
super( Philosopher, self ).__init__()
self.name= name
self.cycles= cycles if cycles is not None else random.randrange(4,7)
self.log= logging.getLogger( "{0}.{1}".format(self.__class__.__name__, name) )
self.log.info( "cycles={0:d}".format( self.cycles ) )
self.forks= None
self.leaving= None
def enter( self, forks, leaving ):
"""Enter the dining room. This must be done before the
thread can be started.
:param forks: The queue of available forks
:param leaving: A queue to notify the footman that they are
done.
"""
self.forks= forks
self.leaving= leaving
def dine( self ):
"""The standard dining cycle:
acquire forks, eat, release forks, philosophize.
"""
for cycle in range(self.cycles):
f1= self.acquire_fork()
f2= self.acquire_fork()
self.eat()
self.release_fork( f1 )
self.release_fork( f2 )
self.philosophize()
self.leaving.put( self )
def eat( self ):
"""Eating task."""
self.log.info( "Eating" )
time.sleep( random.random() )
def philosophize( self ):
"""Philosophizing task."""
self.log.info( "Philosophizing" )
time.sleep( random.random() )
def acquire_fork( self ):
"""Acquire a fork.
:returns: The Fork acquired.
"""
fork= self.forks.get()
fork.held_by= self.name
return fork
def release_fork( self, fork ):
"""Acquire a fork.
:param fork: The Fork to release.
"""
fork.held_by= None
self.forks.put( fork )
def run( self ):
"""Interface to Thread. After the Philosopher
has entered the dining room, they may engage
in the main dining cycle.
"""
assert self.forks and self.leaving
self.dine()
The point is to have the dine method be a direct expression of the Philosopher's dining experience. We might want to override the acquire_fork method to permit different fork acquisition strategies.
For example, a picky philosopher may only want to use the forks adjacent to their place at the table, rather than reaching across the table for the next available Fork.
The Fork, by comparison, is boring.
class Fork( object ): """A Fork. A Philosopher requires two of these to eat.""" def __init__( self, name ): """Create the Fork. :param name: The number of this fork. This may be used by a Philosopher looking for the correct Fork. """ self.name= name self.holder= None self.log= logging.getLogger( "{0}.{1}".format(self.__class__.__name__, name) ) @property def held_by( self ): """The Philosopher currently holding this Fork.""" return self.holder @held_by.setter def held_by( self, philosopher ): if philosopher: self.log.info( "Acquired by {0}".format( philosopher ) ) else: self.log.info( "Released by {0}".format( self.holder ) ) self.holder= philosopher
The Table, however, is interesting. It includes the special "leaving" queue that's not a proper part of the problem domain, but is a part of this particular solution.
class Table( object ): """The dining Table. This uses a queue of Philosophers waiting to dine and a queue of forks. This sets Philosophers, allows them to dine and then cleans up after each one is finished dining. To prevent deadlock, there's a limit on the number of concurrent Philosophers allowed to dine. """ def __init__( self, philosophers, forks, limit=4 ): """Create the Table. :param philosophers: The queue of Philosophers waiting to dine. :param forks: The queue of available Forks. :param limit: A limit on the number of concurrently dining Philosophers. """ self.philosophers= philosophers self.forks= forks self.limit= limit self.leaving= Queue.Queue() self.log= logging.getLogger( "table" ) def dinner( self ): """The essential dinner cycle: admit philosophers (to the stated limit); as philosophers finish dining, remove them and admit more; when the dining queue is empty, simply clean up. """ self.at_table= self.limit while not self.philosophers.empty(): while self.at_table != 0: p= self.philosophers.get() self.seat( p ) # Must do a Queue.get() to wait for a resource p= self.leaving.get() self.excuse( p ) assert self.philosophers.empty() while self.at_table != self.limit: p= self.leaving.get() self.excuse( p ) assert self.at_table == self.limit def seat( self, philosopher ): """Seat a philosopher. This increments the count of currently-eating Philosophers. :param philosopher: The Philosopher to be seated. """ self.log.info( "Seating {0}".format(philosopher.name) ) philosopher.enter( self.forks, self.leaving) philosopher.start() self.at_table -= 1 # Consume a seat def excuse( self, philosopher ): """Excuse a philosopher. This decrements the count of currently-eating Philosophers. :param philosopher: The Philosopher to be excused. """ philosopher.join() # Cleanup the thread self.log.info( "Excusing {0}".format(philosopher.name) ) self.at_table += 1 # Release a seat
The dinner method assures that all Philosophers eat until they are finished. It also assures that four Philosophers sit at the table and when one finishes, another takes their place. Finally, it also assures that all Philosophers are done eating before the dining room is closed.
From
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.linkDescription }}{{ parent.urlSource.name }} | https://dzone.com/articles/multithreading-fear | CC-MAIN-2016-30 | refinedweb | 1,742 | 68.87 |
An autocompletion tool for Python that can be used for text editors.
Project Description
Jedi is an autocompletion tool for Python that can be used in IDEs/editors. Jedi works. Jedi is fast. It understands all of the basic Python syntax elements including many builtin functions.
Additionaly, Jedi suports two different goto functions and has support for renaming as well as Pydoc support and some other IDE features.
Jedi uses a very simple API to connect with IDE’s. There’s a reference implementation as a VIM-Plugin, which uses Jedi’s autocompletion. I encourage you to use Jedi in your IDEs. It’s really easy. If there are any problems (also with licensing), just contact me.
Jedi can be used with the following editors:
- Vim (jedi-vim, YouCompleteMe)
- Emacs (Jedi.el)
- Sublime Text (SublimeJEDI [ST2 + ST3], anaconda [only ST3])
And it powers the following projects:
Here are some pictures:
Completion for almost anything (Ctrl+Space).
Display of function/class bodies, docstrings.
Pydoc support (with highlighting, Shift+k).
There is also support for goto and renaming.
Get the latest version from github (master branch should always be kind of stable/working).
Docs are available at. Pull requests with documentation enhancements and/or fixes are awesome and most welcome. Jedi uses semantic versioning.
Installation
pip install jedi
Note: This just installs the Jedi library, not the editor plugins. For information about how to make it work with your editor, refer to the corresponding documentation.
You don’t want to use pip? Please refer to the manual.
Feature Support and Caveats
Jedi really understands your Python code. For a comprehensive list what Jedi can do, see: Features. A list of caveats can be found on the same page.
You can run Jedi on cPython 2.6, 2.7, 3.2 or 3.3, but it should also understand/parse code older than those versions.
Tips on how to use Jedi efficiently can be found here.
API for IDEs
It’s very easy to create an editor plugin that uses Jedi. See Plugin API for more information.
Development
There’s a pretty good and extensive development documentation..
For more detailed information visit the testing documentation
Changelog
0.7.0 (2013-08-09)
- switched from LGPL to MIT license
- added an Interpreter class to the API to make autocompletion in REPL possible.
- added autocompletion support for namespace packages
- add sith.py, a new random testing method
0.6.0 (2013-05-14)
- much faster parser with builtin part caching
- a test suite, thanks @tkf
0.5 versions (2012)
- Initial development
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/jedi/0.7.0/ | CC-MAIN-2018-17 | refinedweb | 451 | 60.82 |
On Thu, Apr 23, 2009 at 12:08:32PM -0600, Ty! Boyack wrote: > This thread has been great information since I'm looking at the same type > of thing. However it raises a couple of (slightly off-topic) questions for > me. > My recent upgrade to fedora 10 broke my prio_callout bash script just like > you described, but my getuid_callout (a bash script that calls udevadm, > grep, sed, and iscsi_id) runs just fine. Are the two callouts handled > differently?. > > Also, is there an easy way to know what tools are in the private namespace > already? My prio_callout script calls two other binaries: /sbin/udevadm > and grep. If I go to C-code, handling grep's functions myself is no > problem, but I'm not confident about re-implementing what udevadm does. > Can I assume that since /sbin/udevadm is in /sbin that it will be available > to call via exec()? Or would I be right back where we are with the bash > scripting, as in having to include a dummy device as you described? Sorry, the C code is necessary now. > Finally, in my case I've got two redundant iscsi networks, one is 1GbE, and > the other is 10GbE. In the past I've always had symetric paths, so I've > used round-robin/multibus. But I want to focus traffic on the 10GbE path, > so I was looking at using the prio callout. Is this even necessary? Or > will round-robin/multibus take full advantage of both paths? I can see > round-robin on that setup resulting in either around 11Gbps or 2 Gbps, > depending on whether the slower link becomes a limiting factor. I'm just > wondering if I am making things unnecessarily complex by trying to set > priorities. With round-robin, you will send half your IO to the slow path. A priority callout makes sense here. > Thanks for all the help. > > -Ty! > > -- > -===========================- > Ty! Boyack > NREL Unix Network Manager > ty nrel colostate edu > (970) 491-1186 > -===========================- > > -- > dm-devel mailing list > dm-devel redhat com > | http://www.redhat.com/archives/dm-devel/2009-April/msg00324.html | CC-MAIN-2015-06 | refinedweb | 337 | 73.88 |
Cursor initialization API for the core database. All the fuctions here are located in RDM DB Engine Library. Linker option:
-l
rdmrdm
See cursor for a more detailed description of a cursor.
#include <rdmdbapi.h>
Allocate a cursor.
This function allocates and initializes a cursor. The new cursor is associated with the specified database. Once a cursor has been initialized it can be used in other RDM_CURSOR function calls.
An allocated cursor is not associated with any rows. One of the association functions (
rdm_dbGet*,
rdm_cursorGet*, and
rdm_dbInsert*) need to be called to associate the cursor with a collection of rows. Most of the other cursor APIs will return an error if called with a cursor that is allocated but not yet associated with rows.
It is not necessary to explicitly allocate a cursor. The association functions will automatically allocate a cursor if the pCursor parameter is set to NULL prior to calling the association function. | https://docs.raima.com/rdm/14_1/group__db__cursor__init.html | CC-MAIN-2019-18 | refinedweb | 155 | 50.02 |
I would love to know just what I am supposed to do. Oh, so read what they're good for, you say. OK. So, I go to the CD FAQ. And what do I find:. (And in case you happen to need a package later on which is not on one of the CDs you downloaded, you can always install that package directly from the Internet.)"
Wow! That's informative.So, I used Jigdo and I got 3 files. Are you saying each is for a separate CD? I see nothing on the FAQ about what the **** I'm supposed to do with these images and how to install. I've installed 2.2.x millions of times off a single CD someone made for me. He knew how, I don't. So, maybe you could be be a little more informative??????
Curtis Eduard Bloch wrote:
#include <hallo.h> curtis wrote on Wed May 22, 2002 um 11:35:17AM:in the appropriate directory. I permit the installation program to search for the directory itself. It looks for the following: "images-1.44/rescue.bin "And then comes back that it can't find "rescue.bin, drivers.tgz" Without the kernel I can't do anything, right?Oh people, would you PLEASE READ WHAT THE CDS ARE GOOD FOR? The THIRD CD is NOT meant for a standalone installation. It does contain drivers, basedebs, or any other parts needed for the installation, only one boot block to boot with BIOSes that cannot boot from the first CD (multiboot). Gruss/Regards, Eduard.
--To UNSUBSCRIBE, email to debian-user-request@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org | https://lists.debian.org/debian-user/2002/05/msg02916.html | CC-MAIN-2015-18 | refinedweb | 282 | 77.23 |
using continue in a for loop: the order it produces
can someone explain the order of operations for this function, i can not understand the order it is producing:
// output // Yuhu // Tata // Yuhu // Yuhu // 3 public class Main { public static void main(String[] args) { int i; for (i = 0; i < 5; i++) { if (i >= 3) { break; } System.out.println("Yuhu"); if (i >= 1) { continue; } System.out.println("Tata"); } System.out.println(i); } }
why is it not Yuhu, Tata, Yuhu, Tata, 3?
Answers
First iteration: i is 0: i >= 3 is false, so no break. "Yuhu" is printed. i >= 1 is false, so no continue. "Tata" is printed.
Second iteration: i is 1: i >= 3 is false, so no break. "Yuhu" is printed. i >= 1 is true, so continue ends this iteration only. "Tata" is not printed.
Third iteration: i is 2: i >= 3 is false, so no break. "Yuhu" is printed. i >= 1 is true, so continue ends this iteration only. "Tata" is not printed.
Fourth iteration: i is 3: i >= 3 is true, so break breaks out of the for loop, and the output statement after the for loop prints 3.
because it wont get to "Tata" more than once, it only gets there when i=0, continue immediately begins the next iteration of the loop
Try adding more debug statements to figure it out...
int i; for (i = 0; i < 5; i++) { if (i >= 3) { System.out.printf("breaking (i=%d)%n", i); break; } System.out.printf("Yuhu (i=%d)%n", i); if (i >= 1) { System.out.printf("continuing (i=%d)%n", i); continue; } System.out.printf("Tata (i=%d)%n", i); } System.out.println(i);
Prints:
Yuhu (i=0) Tata (i=0) Yuhu (i=1) continuing (i=1) Yuhu (i=2) continuing (i=2) breaking (i=3) 3
Need Your Help
Getting Read time out when connecting to hive/spark sql through squirrel sql
jdbc apache-spark-sql squirrel-sqlI'm trying to use Squirrel SQL to connect to spark-sql thriftserver using jdbc.
URLEncoding a string with Objective-C
objective-c cocoa string urlencodeI'm trying to URL encode a string to form a GET request from objective-c. | http://www.brokencontrollers.com/faq/21540603.shtml | CC-MAIN-2019-26 | refinedweb | 363 | 66.74 |
The Feynman technique says that teaching a subject makes you better at it, which is what I'm trying to do here. You may correct me if you saw mistakes in this post
Passing arguments to components
Remember that our components can be used as custom HTML tags in JSX? To pass arguments to them, we only have to write a custom HTML
attribute for it:
const Recipe = (props) => { return <p>Hello, {props.name}</p>; } let target = document.body; ReactDOM.render(<Recipe name="Fred" />, target);
Note that
props.name is inside a curly bracket, because they need to be evaluated before putting it into the DOM.
For properties of ES6 class style components, you need to write
this.props.name instead.
React also allows setting default values for properties:
const Cupcake = (props) => { return <h1>The Return of {props.evil}!</h1>; } Cupcake.defaultProps = { evil: "Mr. Green" };
You may also want to do type-checking on passed properties, to avoid headaches later on:
const Human = (props) => { return (<ul> <li>Number of arms: {props.armNum}</li> </ul>); } Human.propTypes = { armNum: PropTypes.integer.isRequired }
PropTypes is a class imported from React. They can compare a lot of property types such as
bool,
string,
func, and much more.
isRequired means that this property must have a value passed to it.
React will throw up useful errors if this type-checking fails for any reason.
Note: Properties that are not string must be encapsulated in curly brackets.
States, the main feature of React
In a nutshell, states are data that changes over time (from user inputs, weather, etc.) React automatically updates states in real-time, which is the main strength of React. Note that only stateful components can use states.
States are isolated to its component, unless passed to a child component.
Here's the syntax of declaring one:
class StatefulComponent extends React.Component { constructor(props) { super(props); this.state = { name: "Shite" } } render() { return ( <div> <h1>{this.state.name}</h1> </div> ); } };
Notice the
this.state in the constructor function.
To update a state, use the the setter function
setState(), it is not encouraged to update the states directly. This is because state updates are managed by React to be more performant (This also brings some asynchronous problem, which I haven't learned yet.)
The horror of
this keyword
Okay, I'm totally confused by this one. If you want a function inside the ES6 style component to reference
states or
props, use this:
this.calcLife = this.calcLife.bind(this);
HELP ME
Afterwords
Completely beat up by React's states and
this keyword. I'm gonna need to read more about it.
Overall, fun progress today. Got through almost half of the FreeCodeCamp lessons of React by now. I wanna eat snacks now.
Follow me on Github!
Also on Twitter!
Discussion (0) | https://practicaldev-herokuapp-com.global.ssl.fastly.net/kemystra/day-7-mastering-react-2e05 | CC-MAIN-2022-33 | refinedweb | 465 | 68.36 |
I have made a simple Dynamic Web Project with Eclipse and Maven. I also added
a managed bean which is defined like that:
@ManagedBean(name = "testBean")
@SessionScoped
public class TestBean {
When I try to access testBean from xhtml, I get an error that the bean is
unknown. A workaround is to define the bean in faces-config.xml as a
managed bean but defining the bean with annotations should also work.
I do not know, maybe the whole problem is related to my last post, see
'javax.faces.* classes do not show up with Geronimo 3 runtime in Eclipse':
Currently I am using geronimo-tomcat7-javaee6-3.0-20110805.060355-254.
Best Regards,
Georg
--
View this message in context:
Sent from the Users mailing list archive at Nabble.com. | http://mail-archives.apache.org/mod_mbox/geronimo-user/201108.mbox/%3C1312573338569-3229662.post@n3.nabble.com%3E | CC-MAIN-2016-18 | refinedweb | 129 | 71.44 |
>bind -m vi-command '"ii": vi-insertion-mode' >bind -m vi-insert '"ii": vi-movement-mode' > > >Or the following should work (untested here) using $HOME/.inputrc: > >$if mode=vi > > set keymap vi-command > "ii": vi-insertion-mode > > set keymap vi-insert > "ii": vi-movement-mode > >$endif I've just tested the above inputrc by executing a new bash shell instance and the above inputrc statement works, but there is an undesirable effect when using it. While in insert mode, pressing the 'i' key only once causes readline to intercept it and not print the 'i' char to screen if only pressed once. In order to get the 'i' char printed, I need to immediately press any other key following the 'i' char/key so it is not intercepted by readline as it is not a double 'i' key (ie 'ii'). For example, I'm typing the imaginary command "sit" and accidently typed "st". I go to history and then movement mode and try to insert just an 'i' and will fail as readline is intercepting the single char and awaiting a secondary char to determine if it's a double 'i' key press. I would need to type 'i' and then right cursor to successfully fix the typing error. (Or, to be lazy and humorous, I could just fix it to 'silt' preventing less finger movement.) -- Roger | http://lists.gnu.org/archive/html/bug-bash/2012-01/msg00077.html | CC-MAIN-2015-48 | refinedweb | 227 | 53.44 |
driscoll
02-06-2012, 05:59 AM
This seems like a simple task but I can't figure it out. I have a CSS stylesheet with 4 different xml namespace declarations at the top. I want to hide all of the selectors in the stylesheet from 2 of the declared namespaces. I was given a hint that I could use the display:none rule to achieve this but I can't figure out how to do it. I tried using the namespace prefix on each selector like this prefix|selector {display:none} but that doesn't seem to work.
Thanks for any help!
Thanks for any help! | http://www.codingforums.com/archive/index.php/t-250794.html | CC-MAIN-2016-18 | refinedweb | 107 | 82.65 |
From: Gennaro Prota (gennaro_prota_at_[hidden])
Date: 2003-02-11 06:33:30
On Mon, 10 Feb 2003 16:32:11 -0600, Aleksey Gurtovoy
<agurtovoy_at_[hidden]> wrote:
> I proposed to split "utility.hpp" header a
>long time ago, and there was a general agreement, but it was postponed until
>the release is out, and I never got to doing it after that - even although
>Beman posted a reminder about it
>().
>
>I'll do it sometime this week.
Good news :-) Shooting for Pluto: could we put all the "utilities" in
boost/ instead of boost/utility/ ?
PS: please, don't invoke backward compatibility to preserve an error;
it takes more time to remember what headers are in the utility
directory and thus are to be included with
#include "boost/utility/..."
rather than eliminating "utility/" from the existing #includes once
for all.
Genny.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk | https://lists.boost.org/Archives/boost/2003/02/44139.php | CC-MAIN-2022-33 | refinedweb | 161 | 57.06 |
Azure Release Notes (October 2012)
Updated: November 12, 2012
This document contains the release notes for the Windows Azure – October 2012 release.
For more information related to this release, see the following resources:
- New features inWindows Azure - What's New in Azure
- New features in the Windows Azure Tools for Microsoft Visual Studio - What's New in the Windows Azure Tools
There are significant changes to Windows What's New in Storage Client Library for .NET.
In particular, you can receive the following error if you are using Windows Azure Diagnostics in combination with the Storage Client Library version 2.0.
Error: The type or namespace name 'StorageClient' does not exist in the namespace 'Microsoft.WindowsAzure' (are you missing an assembly reference?)
Windows Azure SDK versions 1.7 and earlier were developed before the availability of Windows Windows Azure SDK 1.8 no longer contains cloud service templates that target .NET Framework 3.5. As a result, you cannot create a new .NET framework 3.5 targeted cloud service with the Windows Azure SDK 1.8. However, you can still open existing .NET framework 3.5 targeted cloud services in the Windows Azure SDK 1.8. You are given an option to upgrade the project. Do not upgrade if you need to continue to support .NET Framework 3.5. For more information see October 2012 release section in What's New in the Windows Azure Tools.
The release notes for Windows Azure Caching are available at Windows Azure Caching Release Notes.About Windows Azure | http://msdn.microsoft.com/pl-pl/library/jj835813.aspx | CC-MAIN-2014-15 | refinedweb | 254 | 68.36 |
- NAME
- SYNOPSIS
- DESCRIPTION
- GENERAL NOTES
- ADMINISTRATIVE FUNCTIONS
- SIGNAL FUNCTIONS
- ALARM OR TIME FUNCTIONS
- FILE ACTIVITY FUNCTIONS
-'s runtime kernel abstraction uses the "bridge" pattern to encapsulate services provided by different event loops. This abstraction allows POE to cooperate with several event loops and support new ones with a minimum amount of work.
POE relies on a relatively small number of event loop services: signal callbacks, time or alarm callbacks, and filehandle activity callbacks.
The rest of the bridge interface is administrative trivia such as initializing, executing, and finalizing event loop.
GENERAL NOTES
An event loop bridge is not a proper object in itself. Rather, it is a suite of functions that are defined within the POE::Kernel namespace. A bridge is a plugged-in part of POE::Kernel itself. Its functions are proper POE::Kernel methods.
Each bridge first defines its own namespace and version within it. This way CPAN and other things can track its version.
# $Id: Loop.pm,v 1.5 2004/11/16 07:12:42 rcaputo Exp $ use strict; # YourToolkit bridge for POE::Kernel; package POE::Loop::YourToolkit; use vars qw($VERSION); $VERSION = do {my@r=(q$Revision: 1.5 $=~/\d+/g);sprintf"%d."."%04d"x$#r,@r}; package POE::Kernel; ... private lexical data and functions defined here ... 1; __END__ =head1 NAME ... documentation goes here ... =cut
The public interface for loop bridges is broken into four parts: administrative functions, signal functions, time functions, and filehandle functions. They will be described in detail shortly.
Bridges use lexical variables to keep track of things. The types and number of variables depends on the needs of each event loop. For example, POE::Loop::Select keeps bit vectors for its select() call. POE::Loop::Gtk tracks a single time watcher and multiple file watchers for each file descriptor.
Bridges often employ private functions as callbacks from their event loops. The Event, Gtk, and Tk bridges do this.
Developers should look at existing bridges to get a feel for things. The
-m flag for perldoc will show a module in its entirety.
perldoc -m POE::Loop::Select perldoc -m POE::Loop::Gtk ...
ADMINISTRATIVE FUNCTIONS
These functions initialize and finalize an event loop, run the loop to process events, and halt it.
- loop_initialize
Initialize the event loop. Graphical toolkits especially need some sort of init() call or sequence to set up. For example, POE::Loop::Gtk implements loop_initialize() like this.
sub loop_initialize { Gtk->init; }
POE::Loop::Select does a little more work. { foreach my $fd (0..$#fileno_watcher) { next unless defined $fileno_watcher[$fd]; foreach my $mode (MODE_RD, MODE_WR, MODE_EX) { warn "Fileno $fd / mode $mode has a watcher at loop_finalize" if defined $fileno_watcher[$fd]->[$mode]; } } }
- loop_do_timeslice
Wait for time to pass or new events to occur, and dispatch events which are due. If the underlying event loop does these things, then loop_do_timeslice() either provide- minimal glue for them or does nothing.
For example, the loop_do_timeslice() function for the Select bridge() is not presented here because it would either be quite large or empty. See the bridges for Poll and Select for large ones. The Event, Gtk, and Tk bridges are good examples of empty ones.
- loop_run
Run an event loop until POE has no more sessions to handle events. This function tends to be quite small. For example, the Poll bridge uses:
sub loop_run { my $self = shift; while ($self->_data_ses_count()) { $self->loop_do_timeslice(); } }
This function is even more trivial when an event loop handles it. This is from the Gtk bridge:
sub loop_run { Gtk->main; }
- loop_halt
Halt an event loop, especially one which does not know about POE. This tends to be an empty function for loops written in the bridges themselves (Poll, Select) and a trivial function for ones that have their own main loops.
For example, the loop_run() function in the Poll bridge exits when sessions have run out, so its loop_halt() function is empty:
sub loop_halt { # does nothing }
Gtk, however, needs to be stopped because it does not know when POE is done.
sub loop_halt { Gtk->main_quit(); }
SIGNAL FUNCTIONS
These functions enable and disable signal watchers.
- loop_watch_signal SIGNAL_NAME
Watch for a given SIGNAL_NAME, most likely by registering a signal handler. Signal names are the ones included in %SIG. That is, they are the UNIX signal names with the leading "SIG" removed.
Most event loops do not have native signal watchers, so it is up to their bridges to register %SIG handlers. Some bridges, such as POE::Loop::Event, register callbacks for various signals.() function tends to be very long, so an example is not presented here. The Event and Select bridges have good examples, though.
- loop_ignore_signal SIGNAL_NAME
Stop watching SIGNAL_NAME. This usually resets the %SIG entry for SIGNAL_NAME to DEFAULT. In the Event bridge, however, it stops and removes a watcher for the signal.
The Select bridge:
sub loop_ignore_signal { my ($self, $signal) = @_; $SIG{$signal} = "DEFAULT"; }
The Event bridge:
sub loop_ignore_signal { my ($self, $signal) = @_; if (defined $signal_watcher{$signal}) { $signal_watcher{$signal}->stop(); delete $signal_watcher{$signal}; } }
- loop_attach_uidestroy WINDOW
Send a UIDESTROY signal when WINDOW is closed. The UIDESTROY signal is used to shut down a POE program when its user interface is destroyed.
This function is only meaningful in bridges that interface with graphical toolkits. All other bridges leave loop_attach_uidestroy() empty. See POE::Loop::Gtk and POE::Loop::Tk for examples.
ALARM OR TIME FUNCTIONS
These functions enable and disable a time watcher or alarm in the substrate. POE only requires one, which is reused or re-created as necessary.
Most event loops trigger callbacks when time has passed. Bridges for this kind of loop will need to register and unregister a callback as necessary. The callback, in turn, will dispatch due events and do some other maintenance.
The bridge time functions accept NEXT_EVENT_TIME in the form of a UNIX epoch time. Event times may contain fractional seconds. Time functions may be required to translate times from the UNIX epoch into whatever representation an underlying event loop requires.
- loop_resume_time_watcher NEXT_EVENT_TIME
Resume an already active time watcher. Used with loop_pause_time_watcher() to provide lightweight timer toggling. NEXT_EVENT_TIME is the UNIX epoch time of the next event in the queue. This function is used by bridges that set time watchers in other event loop libraries. For example, Gtk uses this:
sub loop_resume_time_watcher { my ($self, $next_time) = @_; $next_time -= time(); $next_time *= 1000; $next_time = 0 if $next_time < 0; $_watcher_timer = Gtk->timeout_add( $next_time, \&_loop_event_callback ); }
It is often empty in bridges that implement their own event loops.
- loop_reset_time_watcher NEXT_EVENT_TIME
Reset a time watcher, often by stopping or destroying an existing one and creating a new one in its place. This function has the same semantics as (and is often implemented in terms of) loop_resume_time_watcher(). It is usually more expensive than that function, however. Again, from Gtk:
sub loop_reset_time_watcher { my ($self, $next_time) = @_; Gtk->timeout_remove($_watcher_timer); undef $_watcher_timer; $self->loop_resume_time_watcher($next_time); }
- loop_pause_time_watcher
Pause a time watcher. This should be done without destroying the timer, if the underlying event loop supports that.
POE::Loop::Event supports pausing a timer:
sub loop_pause_time_watcher { $_watcher_timer->stop(); }
FILE ACTIVITY FUNCTIONS
These functions enable and disable file activity watchers. The pause and resume functions are lightweight versions of ignore and watch. They are used to quickly toggle the state of a file activity watcher without incurring the overhead of destroying and creating them entirely.
All the functions take the same two parameters: a file HANDLE and a file access MODE.
Modes may be MODE_RD, MODE_WR, or MODE_EX. These constants are defined by POE::Kernel and correspond to read, write, or exceptions.
POE calls MODE_EX "expedited" because it often signals that a file is ready for out-of-band information. Not all event loops handle MODE_EX. For example, Tk:
sub loop_watch_filehandle { my ($self, $handle, $mode) = @_; my $fileno = fileno($handle); # The Tk documentation implies by omission that expedited # filehandles aren't, uh, handled. This is part 1 of 2. confess "Tk does not support expedited filehandles" if $mode == MODE_EX; ... }
- loop_watch_filehandle HANDLE, MODE
Watch a file HANDLE for activity in a given MODE. Registers the HANDLE (or, more often its file descriptor via fileno()) in the given MODE with the underlying event loop.
POE::Loop::Select sets a vec() bit so the next select() call will know about the handle. It also tracks which file descriptors it has active.
sub loop_watch_filehandle { my ($self, $handle, $mode) = @_; my $fileno = fileno($handle); vec($loop_vectors[$mode], $fileno, 1) = 1; $loop_filenos{$fileno} |= (1<<$mode); }
- loop_ignore_filehandle HANDLE, MODE
Stop watching a file HANDLE in a given MODE. Stops (and possibly destroys) an event watcher corresponding to the HANDLE and MODE.
POE::Loop::Poll manages the descriptor/mode bits out of its loop_ignore_filehandle() function. It also performs some cleanup if a descriptors has been totally ignored.
sub loop_ignore_filehandle { my ($self, $handle, $mode) = @_; my $fileno = fileno($handle); my $type = mode_to_poll($mode); my $current = $poll_fd_masks{$fileno} || 0; my $new = $current & ~$type; if ($new) { $poll_fd_masks{$fileno} = $new; } else { delete $poll_fd_masks{$fileno}; } }
- loop_pause_filehandle HANDLE, MODE
This is a lightweight form of loop_ignore_filehandle(). It is used along with loop_resume_filehandle() to temporarily toggle a watcher's state for a file HANDLE in a particular mode.
Some event loops, such as Event.pm, support their file watchers being disabled and re-enabled without the need to destroy and re-create entire objects.
sub loop_pause_filehandle { my ($self, $handle, $mode) = @_; my $fileno = fileno($handle); $fileno_watcher[$fileno]->[$mode]->stop(); }
By comparison, the loop_ignore_filehandle() function for Event.pm involves canceling and destroying a watcher object. This can be quite expensive.
sub loop_ignore_filehandle { my ($self, $handle, $mode) = @_; my $fileno = fileno($handle); # Don't bother removing a select if none was registered. if (defined $fileno_watcher[$fileno]->[$mode]) { $fileno_watcher[$fileno]->[$mode]->cancel(); undef $fileno_watcher[$fileno]->[$mode]; } }
- loop_resume_filehandle HANDLE, MODE
This is a lightweight form of loop_watch_filehandle(). It is used along with loop_pause_filehandle() to temporarily toggle a a watcher's state for a file HANDLE in a particular mode.
SEE ALSO
POE, POE::Loop::Event, POE::Loop::Gtk, POE::Loop::Poll, POE::Loop::Select, POE::Loop::Tk.
BUGS
Signal handlers are often repeated between bridges:
AUTHORS & LICENSING
Please see POE for more information about authors, contributors, and POE's licensing. | https://metacpan.org/pod/release/RCAPUTO/POE-0.3001/lib/POE/Loop.pm | CC-MAIN-2016-22 | refinedweb | 1,672 | 56.86 |
Writing Great Articles is Difficult
Writing Great Articles is Difficult
... to readers as well as search engines, totally free of cost. Articles form one... each article as an original one.
If you want to truly experience
Great Tattoo ideas for Women
good on thin and boney girls and teens. Next, you can have
great one liners like...Great Tattoo ideas for Women: Sexy, Stylish and Weird Fashion
Women like... even though it's a small butterfly on the neck. There are many
great tattoo ideas
PHP Is Great for Website Creation
PHP is one of the most commonly used and understood types of website creation... and is being loaded onto many servers. Here are some reasons why PHP is so great... for database creation purposes.
PHP can be used to create great websites. A web
more
}//execute
}//class
struts-config.xml
<struts...struts <p>hi here is my code in struts i want to validate my...;gt;
<html:form
All,
Can we have more than one struts-config.xml... in Advance.. Yes we can have more than one struts config files..
Here we use SwitchAction. So better study to use switchaction class - application missing something?
in the struts working and all is great till I close JBoss or the server gets shut down... to the class - like a comment.
I hope this helps others. I saw some one line...struts - application missing something? Hello
I added a parameter
Struts - Struts
for later use in in any other jsp or servlet(action class) until session exist... in struts?
please it,s urgent........... session tracking? you mean session management?
we can maintain using class HttpSession.
the code follows - Struts
i have 3 submit buttons are there.. in those two are similar and another one is taking different action..
as per my problem if we click on first two submit buttons it is going to action in the form tag..
but if we click on third submit
Struts Validation - Struts
Struts Validation Hi friends.....will any one guide me to use the struts validator...
Hi Friend,
Please visit the following links:
http
How to Start Outsourcing, Great Outsourcing Tips
How to Start Outsourcing?
How to Begin Outsourcing? Great Outsourcing Tips... step towards a great outsourcing venture is to start out right. Here we detail... or business.
Some Great Outsourcing Tips:
Plan out your outsourcing business
The Great Ideas to uses of Social Media Marketing
Great Ideas to Use for Social Media Marketing
Anyone who has been online... with one another. Today social media marketing Idea can be
used by an online business... media
marketing.
Finally, a great tip for social media marketing is to offer
Struts Articles
.
4. The UI controller, defined by Struts' action class/form bean... application. The example also uses Struts Action framework plugins in order to initialize the scheduling mechanism when the web application starts. The Struts Action
Struts Books
are rolling, you can get more details from the Jakarta Struts documentation or one... application
Struts Action Invocation Framework (SAIF) - Adds features like Action interceptors and Inversion of Control (IoC) to Str
How Struts Works
as a result of that action. In our application there can be more than
one view which depends on the result of an action. One can be for a success
and the other...
Struts configuration file. Java bean is nothing but a class having getter... more the one action button in the form using Java script.
please give me
MVC - Struts
MVC Can any one help me in good design of an struts MVC....tell me any e-book so that i can download from sitesp
validation - Struts
form.but i don't want the username to be duplicated.means one username must be entered... information,
Thanks
Ajax Dojo Tutorial
by Struts 2 for providing ajax support in
applications. Dojo is one...;
Dojo Tutorials and Examples
Dojo is another great... framework. Dojo is another great JavaScript framework to
develop ajax based
struts 1.x
struts 1.x hi... sir. This is sreenu sir. I am learning struts2 but i have a small doubt i am using include tag. ex include tag is not displayed... me one example
Struts - Framework
using the View component. ActionServlet, Action, ActionForm and struts-config.xml... struts application ?
Before that what kind of things necessary...,
Struts :
Struts Frame work is the implementation of Model-View-Controller2 - Struts
struts2 hello, am trying to create a struts 2 application that
allows you to upload and download files from your server, it has been challenging for me, can some one help Hi Friend,
Please visit the following
Struts Tag:
Struts Tag:
bean:struts Tag -is used to create a new bean containing one of the
standard Struts framework... the Action Mapping in the struts-config.xml is in action class,because it is not exucted ,but formbean will executed...this is my... java.io.IOException;
public class LoginAction extends Action
Struts Login Validation. In This code setter of login page is called only one time again it doesnt call it. Why..?
Struts Login Validation. In This code setter of login page is called only one...-default" namespace="/">
<action name="index" class...;/result>
</action>
<action name="indexLogin" class
Textarea - Struts
characters.Can any one? Given examples of struts 2 will show how to validate...; <action name="characterLimit1" class="... we have created five different files including three .jsp, one .java and one.xml
Tiles - Struts
Inserting Tiles in JSP Can we insert more than one tiles in a JSP page
Ajax in struts application - Ajax
problem is that my jsp page is able to send the request to my Struts Action process...Ajax in struts application I have a running application using struts... it back into JSP.It would be great if you have some example for that.Thanks... architecture. * The RequestProcessor selects and invokes an Action class... resource. * The Action classes can manipulate the state of the application
Struts Video Tutorials
of Struts framework to develop world
class application for their clients...Struts Video Tutorials - Now you can learn the Struts programming easily and
in less time. Struts Video tutorials are very extensive and explained
an Action Class
Developing the Action Mapping in the struts-config.xml... Struts Forward Action Example
...). The ForwardAction is one of the Built-in Actions
that is shipped with struts framework
, Action, ActionForm and struts-config.xml are the part of
Controller...
Struts Guide
- This tutorial is extensive guide to the Struts Framework... com.tecra.struts.dao.UserDao;
/**
*
* @author admin
*/
public class... LookupDispatchAction Example
the request to one of the methods of the derived Action class. Selection of a method...;
Struts LookupDispatch Action... enables a user to collect related functions into a single action class
Struts Dispatch Action Example
Struts Dispatch Action Example
Struts Dispatch Action...
class enables a user to collect related functions into a single Action
Struts Projects
solutions:
EJBCommand
StrutsEJB offers a generic Struts Action class.... In this tutorial we are using one of
the best technologies (Struts...
Registration Action Class and DAO code
In this section we will explain
the request to one
of the methods of the derived Action class. Selection... Action (org.apache.struts.actions.MappingDispatchAction)
is one... to collect related functions into a single
action class. It needs
Struts MappingDispatchAction Example
;
Struts MappingDispatch Action... functions into a single
action class. It needs to create multiple... class except that it uses a unique
action corresponding to a new request | http://www.roseindia.net/tutorialhelp/comment/15493 | CC-MAIN-2014-52 | refinedweb | 1,236 | 68.77 |
Note: This article has been updated to work and compile with the RTM version of the Windows SDK.
Whenever I want to learn something new I find that just working through a tutorial is much easier and less painful then reading the documentation cold and I assume most people feel the same way, because come on, do you actually read the instructions for something before you try to use it? I sure don’t. To this end, I’ve decided the jump right into the action and walk though building a Windows Presentation Foundation application right away and since this is Coding4Fun and since, let’s face it, the world has enough enterprise-web 2.0-data-portal-dodads, were going to make a game. Unfortunately, I don’t think it’s realistic to jump right into making Halo 3 here, so I figured a more bite-sized game might be in order, something we might actually finish by the end of these tutorials, like say a Sudoku game. (Hey, the upside is you might actually get away with playing Sudoku at work). Ok so what do we need to get started? (Install in this order)
You also need to be running Windows XP SP2, Windows Server 2003 SP1, or the Vista February CTP.
Of course, I just happened to have all that installed on my workstation (yeah right). But now that everything is loaded up lets get started. Fire up VC#, create a new project and select “WinFX Windows Application.” (If you can’t see this item you should make sure you’ve installed the Visual Studio Extensions since this is one of the things they add.). I entered “SudokuFX” as the project name, and that’s what you’ll see in the screenshots, but it’s up to you what you call it. Right now you should be starring at this:
<Window x:Class="SudokuFX.Window1"
xmlns=""
xmlns:
<Grid>
</Grid>
</Window>
This is XAML, Microsoft’s new declarative programming language. Classes in XAML can have both code (C# or VB.NET) and declarative (XAML) components. The x:Class attribute of the Window tag specifies the name of C# component of the class we are defining. The C# part should look like this:
namespace SudokuFX
{
public partial class Window1 : Window
{
public Window1()
{
InitializeComponent();
}
}
}
When the program is compiled and run the two halves combine together to create a complete Window1 class, which derives from the System.Windows.Window class provided by WinFX. The only other non-obvious thing you need to know here is that all the objects declared in XAML can be accessed from code or vice-versa. In fact, you can write a class using the same API with no XAML at all! The nested elements are placed into collection stored as a property on their parent called Children, or in object that can contain only one other object they are assigned to the Content property. So in other words this XAML code creates an instance of Grid and places it in the window’s Content property.
So, how do we go about laying out the application? Well basically the goal layout is to have a title at the top, the game menu down the left, similar to the “tasks” pane in Windows explorer, the game timing info on the right, the move history on the bottom, and the board in the center. Of course this should all be resolution independent and dynamically resize and flow. (If you’ve used Windows Forms before, the sweat might be already beading on your forehead as your migraine develops, but don’t worry, dynamic resizing and flow is the default.) The best container for the job is the obviously-named DockPanel. The DockPanel is a container control that arranges it children based which side they are attached to; the last element added is then used to fill the remaining space. For example, replace the Grid tag with:
<DockPanel>
<TextBlock Background="Red" DockPanel.
Sudoku
</TextBlock>
<StackPanel Background="Green" DockPanel.
<Button>A</Button>
</StackPanel>
<StackPanel Background="Blue" DockPanel.
<Button>B</Button>
<ListBox Background ="Gray" DockPanel.
<StackPanel Background ="Yellow"/>
</DockPanel>
The DockPanel.Dock syntax is used to refer to a per-child but container-specific property. Another example of this is the Canvas.Left property, which is used with elements inside a Canvas, a container control that allows you to explicitly position elements. The StackPanel container arranges its children in vertical or horizontal stack, going either up or down or left or right. Right now I’ve added some buttons just pad out the panels so they don’t shrink away to nothing and some garishly horrible background colors we’ll remove later so it’s evident exactly how things are laid out. If you compile and run the program you get this monstrosity:
Ok, now its time to grind out some code to get a basic UI going. First lets layout the left panel: there’s going to be the main menu and the new game settings and lets throw them in expander controls just incase anyone who uses our program runs at 800x600 (It’s frightening I know, but I’ve seen it).
<StackPanel DockPanel.
<Expander IsExpanded ="True" Header ="Main Menu">
<StackPanel>
<Button>New Game</Button>
<Button>Load Game</Button>
<Button>Save Game</Button>
<Button>Quit</Button>
</StackPanel>
</Expander>
<Expander IsExpanded ="True" Header ="New Game Settings">
<TextBlock>Board Size:</TextBlock>
<ComboBox IsEditable ="False">
<ComboBoxItem IsSelected ="True">9x9</ComboBoxItem>
<ComboBoxItem>16x16</ComboBoxItem>
<ComboBoxItem>25x25</ComboBoxItem>
<ComboBoxItem>36x36</ComboBoxItem>
</ComboBox>
</Expander>
</StackPanel>
This gives you:
Ok, so maybe that doesn’t look too awesome right now, but wait there’s more the come! After fleshing out the rest of the UI in similar fashion and adding a dummy image for the board (we’ll make the board in a future tutorial) we get this:
Now, how do we improve the look and feel of this UI? Well, one way would be to tweak all the properties of the controls individually to make them look better; another would be to use some kind of skinning. Unfortunately, these techniques add clutter to your code and are difficult to maintain, what we can use instead is WPF’s notion of styles. WPF makes it quite easy to customize controls across a given scope, for example: the application as a whole, a particular dialog, or a single container, by defining a new set of default property values. You can do this by adding styles to the Resources collection of another object. In XAML, if you want to assign a more complex object or collection of objects to a property you can expand the property out from the Property="Value" syntax to the
<Object.Property>
<ValueObject/>
</Object.Property>
syntax. For example, this code assigns the color blue as the background color for all buttons in the application, unless it is explicitly set otherwise:
<Application.Resources>
<Style TargetType ="{x:Type Button}">
<Setter Property ="Background" Value ="Blue"/>
</Style>
</Application.Resources>
Styles can also be named using the x:Key property. The reason why x:Key is used instead of x:Name is because <Application.Resources> is actually a list of key-value pairs. For example we could define:
<Style x:
This creates a style which only applies to certain buttons, buttons that reference it with their Style property. For example:
<Button Style="{StaticResource BlueButton}"/>
You can also define resources (there are also other types than styles) inside windows, panels, or other objects that have a Resources property. When code references a resource a search is made outwards up to the application level thus styles or other resources defined in <Window.Resources>, for example, only apply inside that window.
So far I haven’t explained the brace notation I’ve been using. Essentially, braces are used to declare references to other object but not instantiate them. For example, {x:Type Button} refers to the Button class, while {StaticResource BlueButton} searches the resource hierarchy for the item with the key “BlueButton”. The StaticResource directive indicates that this search is to be carried out when the object is first created, but DynamicResource can also be used to specify that the value should be continually updated.
Now we can start adding a style to improve the look of the expander. I added this to the <Application.Resources> section:
<Style TargetType ="{x:Type Expander}">
<Setter Property ="Background">
<Setter.Value>
<LinearGradientBrush StartPoint ="0,0" EndPoint ="1,0">
<LinearGradientBrush.GradientStops>
<GradientStop Color ="LightGray" Offset ="0"/>
<GradientStop Color ="Gray" Offset ="1"/> </LinearGradientBrush.GradientStops>
</LinearGradientBrush>
</Setter.Value>
</Setter>
<Setter Property ="BorderBrush" Value ="DimGray"/>
<Setter Property ="BorderThickness" Value ="1"/>
<Setter Property ="Margin" Value ="5"/>
<Setter Property ="HorizontalContentAlignment" Value ="Stretch"/>
<Setter Property ="Foreground" Value ="White"/>
<Setter Property ="VerticalContentAlignment" Value ="Stretch"/>
</Style>
This is a pretty straightforward style, although it does nicely demonstrate the two property assignment syntaxes. The background is set to a horizontal gradient between two shades of gray and the rest of the properties are assigned to sensible defaults the work well with the background. I’ve also added an extra border around the inside of the control by adding an extra Border tag inside the expander’s content like so:
<Expander IsExpanded ="True" Header="Main Menu">
<Border Margin ="5" Padding ="10"
Background ="#77FFFFFF" BorderBrush ="DimGray" BorderThickness ="1">
</Border>
</Expander>
The Margin property specifies the spacing border on the outside, while the Padding property specifies the extra spacing on the inside although only container controls can have padding. Both values are specified by either four comma separated values for left, top, right, and bottom, respectively, or a single number if all four are the same (as they are here).
If you think this is kind of a kludge, you’re right. In fact I could have included the extra border inside the control itself using my custom style. To do this you can modify what’s called the control’s template, but that’s a whole other topic so I’ll just do this for now. Don’t worry, we’ll come back and fix this later. After whipping up some other styles, which you can check out if you download the code, and adding a nice gradient for the window background the application looks a lot better……ok, well at least it’s more colorful.
Finally, to close off this part of the tutorial, let’s add some simple event handling to make the “Quit” button work. This is actually very easy. Just define a method that conforms to the RoutedEventHandler delegate in your Window1 class. For example:
void QuitClicked(object sender, RoutedEventArgs e)
this.Close();
Then just set the Clicked property of the button to the name of your handler like this:
<Button Click ="QuitClicked">Quit</Button>
Now, if you click the quit button the program will exit. This is essentially all there is to handling simple events!
Ok, well that’s all for now, I hope this tutorial has at least given you a feel for how WPF applications work and how to start building an app. We’re just scratching the surface of what you can do with this framework and .NET 2.0! Stay tuned for the next parts of the tutorial that finish the application and cover cool stuff like:
Keep coding!
If you would like to receive an email when updates are made to this post, please register here
RSS
Great tutorial. I'm just starting to explore WPF world, and you made it very accessible.
Thanks
A nice easy to follow demo. It also scares me...it points to the awesome complexity of this new technology. As powerful as it is I think it's going to require a lot of time to get the hang of it.
A while ago I played around with DataBinding an tried to implement a Sudoku Game similar to Sudoku in
Sudoku challenge:
Part 1:
Part 2:
Part 3:
Part 4:
Part 5:
"Whenever I want to learn something new I find that just working through a tutorial is much easier and less painful then reading the documentation cold and I assume most people feel the same way"
Yes, of course, I feel the same way, and this what I need, Thanks a lot!
Really helpful, hope that there more tutorial like this.
Link to download source code is broken and so are the image links - none of the pictures are loading.
I just started working with WPF today, and this looked like a great introduction. Sadly, the text doesn't contain all the code, and the download link at the top of the article is not working.
Is the download available somewhere else?
@Doug: Fixed the download link. Thanks for informing about it.
it would be useful if you updated the download links for the WinFX February 2006 CTP, and those other packages. ;) Especially since you're using older packages, it might be hard to find the correct ones.
@harm, we have the issue of there is a lot of content on the site and only myself typically to update it on top of my normal job. Once the articles are written, 9 times out of 10 will be forgotten about until someone has a question about them.
Hi,
Great tutorial.
Could you please check the source code link? It seems to be broken.
Thank you. | http://blogs.msdn.com/coding4fun/archive/2006/11/06/999502.aspx | crawl-002 | refinedweb | 2,212 | 60.45 |
Sort the given biotonic doubly linked list. A biotonic doubly linked list is a doubly linked list which is first increasing and then decreasing. A strictly increasing or a strictly decreasing list is also a biotonic doubly linked list.
Examples:
Approach: Find the first node in the list which is smaller than its previous node. Let it be current. If no such node is present then list is already sorted. Else split the list into two lists, first starting from head node till the current’s previous node and second starting from current node till the end of the list. Reverse the second doubly linked list. Refer this post. Now merge the first and second sorted doubly linked list. Refer merge procedure of this post. The final merged list is the required sorted doubly linked list.
// C++ implementation to sort the biotonic doubly linked list #include <bits/stdc++.h> using namespace std; // merge two sorted doubly linked lists struct Node* merge(struct Node* first, struct Node* second) { // If first linked list is empty if (!first) return second; // If second linked list is empty if (!second) return first; // Pick the smaller value if (first->data < second->data) { first->next = merge(first->next, second); first->next->prev = first; first->prev = NULL; return first; } else { second->next = merge(first, second->next); second->next->prev = second; second->prev = NULL; return second; } } // function to sort a biotonic doubly linked list struct Node* sort(struct Node* head) { // if list is empty or if it contains a single // node only if (head == NULL || head->next == NULL) return head; struct Node* current = head->next; while (current != NULL) { // if true, then 'current' is the first node // which is smaller than its previous node if (current->data < current->prev->data) break; // move to the next node current = current->next; } // if true, then list is already sorted if (current == NULL) return head; // spilt into two lists, one starting with 'head' // and other starting with 'current' current->prev->next = NULL; current->prev = NULL; // reverse the list starting with 'current' reverse(¤t); // merge the two lists and return the // final merged doubly linked list return merge(head, current); } // Function to insert a node at the beginning // void printList(struct Node* head) { // if list is empty if (head == NULL) cout << "Doubly Linked list empty"; while (head != NULL) { cout << head->data << " "; head = head->next; } } // Driver program to test above int main() { struct Node* head = NULL; // Create the doubly linked list: // 2<->5<->7<->12<->10<->6<->4<->1 push(&head, 1); push(&head, 4); push(&head, 6); push(&head, 10); push(&head, 12); push(&head, 7); push(&head, 5); push(&head, 2); cout << "Original Doubly linked list:n"; printList(head); // sort the biotonic DLL head = sort(head); cout << "\nDoubly linked list after sorting:n"; printList(head); return 0; }
Output:
Original Doubly linked list: 2 5 7 12 10 6 4 1 Doubly linked list after sorting: 1 2 4 5 6 7 10 12 k sorted doubly linked list
- Remove duplicates from an unsorted doubly linked list
- Convert a given Binary Tree to Doubly Linked List | Set 4
- Insertion Sort for Doubly Linked List
- Reverse a Doubly Linked List
- Rotate Doubly linked list by N nodes
- Sort the linked list in the order of elements appearing in the array
- Reverse each word in a linked list node
- Insertion in Unrolled Linked List
- Find middle of singly linked list Recursively
Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here. | https://www.geeksforgeeks.org/sort-biotonic-doubly-linked-list/ | CC-MAIN-2018-13 | refinedweb | 580 | 61.7 |
This is the first article in a series of three which will explain step-by-step how to implement UIPAB Version 2. The benefits of UIPAB will be demonstrated by firstly examining the non UIPAB approach. Also, UIPAB will be demonstrated within the broader context of Patterns and Practices and .NET application Blocks.
An understanding of the ESP Layered pattern is advantageous. The code relies on various App Blocks, so an understanding of DAAB (Data Access App Block v2), CMAB (configuration Management App Block) and EMAB (Exception Management App Block) will be helpful.
The code download consists of a SQL script to set up the database and four C# projects: UIPABBE (contains the Business Entity classes); UIPABData (contains the Data Access Logic Classes which utilize the DAAB); UIPABWin1 (which which the basic forms and stub code - this application does not work but is used as the basis for all subsequent working applications in this series); UIPABWin2 (a windows application that does not use UIPAB).
I recently delivered a talk for at Microsoft South Africa�s offices in Johannesburg. The audience comprised of Johannesburg�s more informed and talented .NET developers. I asked members of the audience if anyone had used the User Interface Process Application Block (UIPAB) and no one raised his or her (there were only three hers in the audience) hand. My talk was an hour and in that time I had to give a rushed explanation of UIPAB. My aim was to show the benefits of using the Patterns and Practices Application Blocks and my basic message was that the App Blocks takes .NET to an entirely new level of versatility, sophistication and, in my eyes, elegance. In the little time I had at my disposal, and judging from the responses I have subsequently received, I think I got my message across. I managed to convince my audience that App Blocks, and indeed the entire PP initiative, is crucial to serious, high-powered .NET development. Unfortunately, because of time constraints, I was unable to explain the delicate mechanics of UIPAB implementation in sufficient detail so as to allow my audience to go away and begin experimenting with the UIPAB. Some in the audience admitted that they had looked at the UIPAB and had tried to master it with the supplied literature, but found the task too daunting or the help file too complicated or too technical for quick practical implementation. Aside from the .PDF manual and the Help file supplied with the download, there is no other UIPAB literature. The documentation is thorough, but clearly too thorough for the novice or too dense for the time-constrained, dead-line-pressurized developer. The UIPAB, like the other App Blocks, comes with a wealth of examples, unfortunately, none of these examples are documented and you are forced to deconstruct the code on your own � for a new paradigm, a daunting task in and of itself. What is needed, therefore, is a step by step approach which will slowly introduce the potential UIPAB user to the benefits of using the App Block. These benefits can be shown using the minimum features of UIPAB, especially when we can show how an old style front end can be refactored using the UIPAB. While it is important to understand the UIPAB under the hood, such an in-depth understanding is not essential to start working with it. The documentation is by and large devoted to under-the-hood detail, and this is probably the reason for the general reticence I have encountered in using it. What I propose to do in this series of articles on the UIPAB is a step-by-step guidance to using the UIPAB. It is important to understand that the UIPAB is part of the PP initiative. I think it is wrong to study the UIPAB in isolation from the overall PP picture. This first article will therefore attempt to place UIPAB within the context of PP. I will briefly touch on the ESP .NET Layered Pattern and demonstrate what I think is the right approach in developing the Business and Data layers. I think that the true power of the App Blocks is unleashed when they work together in the same application, and so I will include the Data Access App Block (DAAB), the Configuration Management App Block (CMAB), and the Exception Management App Block (EMAB) in my Business and Data layers. I will then present the simple WindowsForm demo-example I will be using. I will show the various forms, controls and work-flow of the demo which will be common to all versions of the demo I will canvass in this series. Then I will present a non-UIPAB version of the demo where I will point out the drawbacks of using this old way of doing the UI.
In next article I will introduce the MVC pattern and show how this pattern attempts to solve the problems encountered in the old way of doing things. Also I want to emphasize that an appreciation of MVC is central to understanding the UIPAB. I will then examine the UIPAB using a step-by-step didactic approach instead of the detailed, technical approach found in the UIPAB documentation. I want to give an overview of the UIPAB objectives, its basic building blocks and a brief checklist on how to start developing simple UIPAB UI�s. I will then refactor the original WindowsForm application presented in the previous article this time using UIPAB. Lastly, I will show how the same refactored code can be reused in an ASP.NET application. In this first example I will be stripping UIPAB of all its detail and focusing on its core, basic features.
In the third article, I will build on the example we used to show UIPAB in more detail. Whereas the first example will deal with a single UI Process or Task (basically a Use Case), the second example will deal with two UI Processes and show how they can be linked. Also, the first example will not deal with snap-shot State persistence, the second example will.
The last article in the series will again refactor my example so as to demonstrate the various navigational abilities of UIPAB. The other examples use the Navigation Graph; the final example will show the use of all the UIPAB navigational capabilities. Also, in this final article, I will briefly discuss customizing the UIPAB.
I suggest at this stage that you download the UIPAB from here if you have not done so already and install it on your development machine. You will need an installation of .NET Framework 1.1 and Visual Studio .NET 2003.
The first sentence of Chapter 1 of Fowler�s Patterns of Enterprise Architecture is a succinct description of what layering is:
�Layering is one of the most common techniques that software designers use to break apart a complicated software system�
It is important to stress what Layering it is not. A �layer� does not refer to a physical entity or separation. The term used for referring to such a physical entity is �tier�. A �multi-tiered� system is one which comprises a number of physical tiers. A �layer� therefore is a logical or conceptual software entity. A layer is deployed to one or more tiers. I have dealt with the .NET Enterprise Solutions Pattern adoption of the layered pattern in my article The Microsoft Patterns & Practices Initiative: Part 2 � The Layered Pattern and I refer interested readers to that article for more detail. (The article can be downloaded from or or from under Resources then Ayal�s Articles).
To summarize: There are three main layers each with its own sub-layers as follows:
A Visual Studio Application Architecture Template Policy has been released that enforces the ESP layered pattern within the VS.NET 2004 IDE. The Template Policy can be downloaded from: under Resource then Architecture (registration is required). I will be using this Template in all the examples. (I am unable to find the original URL at where this policy was originally released).
For this first article I have deliberately chosen a simple example. All the sample application does is display a list of persons. The user can then add new persons to the list or update the details of an existing person. The person�s details are also simple: each person has a first name and last name; furthermore, each person can have one or more addresses or contact numbers associated with him. The sample application contemplates a future refactoring into a Service Oriented Application which will use the Offline Application Block, so I have tried to cater for this future development into the architecture from the start. When the application starts up, a list of all existing persons are retrieved from the data-store. This list is presented to the user where it is persisted. The user can now add new persons to the localized list; if the user updates an existing person already in the list, the application checks whether the selected person�s details have been retrieved from the data store; if the details have not been retrieved, these details are retrieved and presented to the user; if the details have already been retrieved, the person is presented to the user for editing. Only when the user has finished working with the list of persons, is the entire list sent back to the data-store. Newly inserted persons are registered with the data store; persons whose details have been updated are updated on the data-store.
The architecture therefore is one of an initial batch-down load; working locally on the UI and then a batch up-load to the data-store again. This is a disconnected paradigm which aims to keep data-access to the minimum. The example does not deal with concurrency or transactional issues.
The demo application will make use of a number of Application Blocks( Data Access, Configuration Management and Exception Management). I will not be discussing the mechanics of these other App Blocks but I thought it appropriate to include them in this demo. I repeat: It is my belief that the true power of the App Blocks is enhanced when you begin to use them together and it is best to start using this technique from the outset. (Hopefully � time and energy permitting � I will have occasion to examine these App Blocks in other articles.)
The Data Schema is fairly straight forward. There are three tables: Person, Address and Contact � each with a Primary Key as an Identity Field.
There are three types of stored procedures defined for each table:
The Person table has an extra stored procedure which retrieves a list of all rows in the table.
The SQL Script to set up the data-base schema and the stored procedures is supplied in the download. The application assumes a SQL authentication mode for database access. The specific of the data-base access string will be configured using the Configuration Management App Block (CMAB) � so you don�t have to worry about it at this stage.
Because the sample is a pretty simple application, there are no real business rules or processes involved. I am therefore only going to be developing the Business Entity sub-tier. There is a lot of discussion about what is the best way to develop .NET business entities within the context of the ESP Layered pattern. For a thorough treatment of the subject I refer you to the following:
My approach is derived from two overriding considerations: Firstly, like Martin Fowler, I am an object bigot and therefore tend to insist that that my business entities adhere to strict OO rules. Secondly, I am also a Layered Fundamentalist which means I try to stick to the ESP Layered Pattern as far as possible. Being an object bigot, there can be no place for ADO.NET classes and structures in my business entities i.e. no room for datasets, data tables, data rows or data relations. Being a Layered Fundamentalist, my business entities should not be doing what my other Business Layer sub-layers (Business Components and Business Workflows) should be doing. Practically speaking this means that my business entities are classes with attributes (properties) and nothing much more. Where operations (methods) are required, they are simple, straight-forward and serve merely to qualify a property. Business process, rules and workflows belong in the other sub-layers. This approach is conducive to reuse of my business entities; if the business rules were embedded into them, their reuse would be precluded. By being a Layered Fundamentalist I can reuse my business entities even when the business rules change. In the real world, this is what happens: the business entities are more-or-less static but the business rules are constantly changing.
All bigots are disadvantaged and object bigots are no exception. Because my business entities are pure they have no trace of ADO.NET components i.e. no DataSets, DataTables, DataRows and DataRelations, which also means no seamless ability to serialize into XML. Furthermore, whenever I access a relational data store to populate my business entity or update the data store with my business entities data, I will have to go through a long and cumbersome Object-Relational-Mapping (ORM) exercise. To add to my problems, at the end of the day, I want to display my business entities to the end-user, without ADO.NET the rich feature set of data-binding is not as readily available to me. So bigotry comes at a cost. The advantage of strict OO, however, far outweighs the disadvantages. The purist approach is aesthetically superior. When you mix models (relational with OO) the code tends to get messy and is inelegant. Also, the more complex the demands made on your business entities, the more you will come to realize that the short-term benefits of a hybrid can turn into a trap. If there is anything I have learned as a developer, it is that elegance and aesthetics is the best guarantee of longevity and performance.
All my business entities inherit from a base business entity class:
The BaseBE encapsulates properties that are common to all business entities. There are four properties and one protected method. The method,
validate(), must be implemented by the specific business entity. In
validate(), UI validation rules are coded.
The four properties are as follows:
namespace UIPABBE { [Serializable] public abstract class BaseBE { private string id; protected bool valid, dirty, isnew; public BaseBE():this(0){} public BaseBE(int id) { this.id = id.ToString(); this.dirty = false; } public string ID { get{return id;} set{id = value;} } public bool Valid{get{return valid;}} public bool isDirty { get{return dirty;} set{dirty = value;} } public bool isNew { get{return isnew;} set{isnew = value;} } protected abstract void validate(); } }
As you can notice the BaseBE is marked with the
[Serializable] attribute. UIPAB maintains state; this state can be persisted and so all state objects must be serializable. As a rule of thumb, you should always serialize your business entity classes. (I have used declarative serialization in this example. If you are going to be using the advanced features of UIPAB, I recommend using deterministic serialization. This entails a fluent proficiency of .NET object serialization.)
The sample Business Entity layer consists of three simple classes, each representing a table in the data base: Person, Contact and Address. The classes are available in the source code of the UIPABBE project.
We will examine the Person business entity to get an understanding of the basic mechanics of what a business entity object does.
using System; using System.Collections; namespace UIPABBE { [Serializable] public class Person: BaseBE { #region PRIVATE FIELDS private string first, last; private ArrayList contact = new ArrayList(); private ArrayList ad = new ArrayList(); #endregion #region CONSTRUCTORS public Person():this(0, "", ""){} public Person(int id, string first, string last):base(id) { this.first = first; this.last = last; validate(); } #endregion #region PROPERTIES public event EventHandler FirstChanged; public event EventHandler LastChanged; public string Firstname { get{return first;} set { if(this.first != value) this.dirty = true; first = value; if(FirstChanged != null)FirstChanged( this, EventArgs.Empty); validate(); } } public string Lastname { get{return last;} set { if(this.last != value) this.dirty = true; last = value; if(LastChanged != null)LastChanged(this, EventArgs.Empty); validate(); } } public ArrayList Contacts { get{return contact;} set{contact = value;} } public ArrayList Addresses { get{return ad;} set{ad = value;} } #endregion #region OVERRIDES public override string ToString() { return this.Firstname + ", " + this.Lastname; } protected override void validate() { if(this.Firstname.Length > 0 && this.Lastname.Length > 0) this.valid = true; else this.valid = false; } #endregion } }
Pay attention to the following features:
ToString()method is overridden. This is done to facilitate seamless data binding in the UI. If no specific property of the bound object is specified as the display, the control displays the
ToString()output of the object.
ArrayList. This is a crude approach and should not be utilized in an enterprise business entity. (The full version of an enterprise business entity has a
BaseBESetclass which represents a list of business entities. Each business entity will therefore also inherit from the
BaseBESetwhich is strongly typed. For the purposes of the UIPAB simple demo, the crude approach will suffice to avoid complications.)
Access to the data storage is strictly through the Data layer and the Data Access Logic Components (DALC) sub-layer to be more precise. The DALC layer utilizes the Data Access Application Block (DAAB v2) and so the DAAB should be referenced. Also, the DALC layer will be receiving and retrieving business entities, therefore the business entity project must also be referenced. (According to the Team Developer P&P guideline, best practice is to reference the project and not the specific project .DLL). Strictly speaking the DAAB is a DALC best-practices implementation. So the project I am going to create in the DALC layer is a project-specific fa�ade to the DAAB. (Again, the enterprise version of the DALC will be different from the version I am going to present here. By and large, the main difference is to centralize common behaviour in a base class and then make sure that all the DALC classes inherit for this base class.).
In the current version, I created a Data Access class for each business entity. The idea is to isolate data-access on a per-table, per-entity basis. Because the data store is relational, this sort of strict isolation is impossible; it is here where the relational world unavoidably encroaches on the OO world. (In a later series I intend to show how products like Matisse � which is a post relational data base with a .NET binding � can avoid this conundrum.) Where the data access is from a �join-table� i.e. a table which contains elements from two other tables, I place the data access code in the data access entity class which is predominant in the operation. For example: when I have to retrieve a person�s contact details, the predominant data that is retrieved is the contact information and so the
getContactByPerson access will be placed in the Contact data access class.
Accordingly there are 3 Data Access classes:
PersonData,
AddressData and
ContactData. The methods in each class correspond to a single stored procedure in the data base. The idea is to make the data-access as granular as possible. (Data Transaction and Concurrency issues are not handled in this version of the Data Access classes but the enterprise version should handle all data concurrency. Transaction handling should also be managed in the DALC layer.) Following the P&P recommendations, the DALC methods are all static. We will examine the
AddressData class as an example:
using System; using System.Collections; using System.Data; using System.Data.SqlClient; using UIPABBE; using Microsoft.ApplicationBlocks.Data; namespace UIPABData { public class AddressData { private static string con = DataConString.ConString(); public static ArrayList getPersonAddresses(string id) { ArrayList list = new ArrayList(); string proc = "getAddressesByPerson"; SqlParameter[] sparams = new SqlParameter[]{ new SqlParameter("@id", int.Parse(id))}; DataSet ds = SqlHelper.ExecuteDataset(con, proc, sparams); foreach(DataRow dr in ds.Tables[0].Rows) list.Add(new Address((int)dr["ID"], dr["Street"].ToString(), dr["Province"].ToString(), dr["Country"].ToString())); return list; } public static string insAddress(Address add, string id) { string proc = "insAddress"; SqlParameter[] sparams = new SqlParameter[]{ new SqlParameter("@personid", int.Parse(id)), new SqlParameter("@street", add.Street), new SqlParameter("@province", add.Province), new SqlParameter("@country", add.Country)}; return Convert.ToString(SqlHelper.ExecuteScalar( con, proc, sparams)); } public static void upAddress(Address add) { string proc = "upAddress"; SqlParameter[] sparams = new SqlParameter[]{ new SqlParameter("@id", int.Parse(add.ID)), new SqlParameter("@street", add.Street), new SqlParameter("@province", add.Province), new SqlParameter("@country", add.Country)}; SqlHelper.ExecuteNonQuery(con, proc, sparams); } } }
Pay attention to the following:
System.Dataand the
System.Data.SqlClientnamespaces.
SqlHelperclass of the DAAB.
DataConStringclass.
You will notice two extra classes in the DALC layer: the
ConstringSH and the
DataConString. I have placed both these classes in the same .cs file i.e. ConStringSH.cs. . The reason I have done this is to demonstrate the use of the CMAB. (Initially I thought this was an overkill for a simple demo of the UIPAB, but on consideration, I am of the opinion that it important to begin using the App Blocks together right from the start.) The two extra classes are CMAB specific. The
DataConString is a simple class whose properties represent the elements of the SQL authentication access string and whose
ToString() method represents the SQL access string. The string values are read according to the CMAB configuration in the UI layer. (Note: never produce production code for data access strings the way I have - it is insecure and a recipe for disaster. I am doing it this way to give you a feel of CMAB without going into the security intricacies.)
Now that I have set up the Business and Data Layers, I can now concentrate on the Presentation Layer. The end user (and probably your managers and bosses) see and judge your application from the perspective of the Presentation Layer. From my experience, no matter how much I try talk myself and my team into saying that look and feel is not important, I have found that my projects are ultimately judged by the end-user experience, and they make their judgment on look, feel, intuitive work-flow and ease of use. As serious developers we might feel a bit cheated in having our work judged by what we think as the most inconsequential part of the application � the front end. But that is the way most of the world will judge us. The Layered Pattern can help us achieve our objective in this regard. It mandates that we develop our Business and Data layers independently from our front ends; it also envisages less change to these layers than to the Presentation layer. When we come to the Presentation Layer, we should not worry about business and data concerns; this will allow us to concentrate our skills, talent and time into developing pretty, intuitive and user-friendly user interfaces. Also, because the UI is independent of the other layers, we can easily change our UI�s without having to change our business and data access code.
The Presentation Layer is a sub-system in itself, with its own workflows, data requirements and business rules and processes in addition to look and feel. For example: Form A must launch Form B and From B must return us to the Main Form � this navigational route is workflow specific to the Presentation Layer. Without the UIPAB, we have to embed these UI specific business requirements into the UI code. As we will see, this is severely limiting and goes a long way to defeat the purpose of the Layered pattern, which we have so faithfully adopted in the Business and Data layers.
In the remainder of this article and the next article, I propose to do the following:
The Demo UI elements can be found in the source code as UIPABWin1.proj - this application is not intended to work at this stage. The project comprises of 4 Windows forms: Form1, frmAddress, frmContact, frmList, frmPerson. Throughout all versions of the UI, we will be sticking to these 4 basic UI elements without changing their look or their constituent controls.
The UI work-flow is as follows:
In UIPABWin1, I have hooked up all the UI events. These events will trigger and control the work-flow, and will be consistent throughout all the UI variations we will be examining.
In summary UIPABWin1 does the following:
As I move onto the demo version without the UIPAB, you will notice that I am forced to add a lot of code and extra procedures to the basic outline I have set up in UIPABWin1. When I do the version with UIPAB, you will notice that I return back to the basic skeleton code of UIPABWin1, and all I will be doing is adding a few lines of code in the event handlers.
UIPABWin2 is the demo version without the UIPAB. You will find it in the source code download as UIPABWin2.proj. UIPABWin2 is a fully working application. In fact, you will see when we demonstrate the UIPAB version of this application, that both versions work exactly the same and look exactly the same. The code and structure is vastly different.
Befoe you run UIPABWin2 make sure you configure the config. file with the correct SQL Data Access information.
In the config file locate the XMLConstring XML element. This element has a child element DataConString. Which in turn has the child elements: Server, UID, DB and PWD. You will have to enter the correct UID and PWD. The UID and PWD should reflect a valid SQL User name for SQL authentication to the UIPAB database.
UIPABWin2 has added references, code, new variables and methods to each form. The purpose of all these additions is to achieve the following:
I don�t want to labour the point by examining all the code in UIPABWin2. For the purposes of illustration, I will deal with frmList only. You should examine the rest of the code in the other forms on your own, and you will understand the point I am trying to make.
First off note the project references:
Microsoft.ApplicationBlocks.ConfigurationManagement- this is required for data connection string handling. (I tried referenced the App Block where I thought it should be referenced i.e. in the DALC layer, but it didn�t work. It seems to me that the DALC layer is most appropriate location for referencing the App block and I don�t see anything in the documentation which says that an intermediate layer cannot have its own app.config file. All I can say is that the DALC did not find its app.config file and I was forced to reference CMAB in the UI. I am not sure if this because of my ignorance or a flaw in .NET � I would appreciate help in this regard.)
The code in Form1�s Button click event handler is as follows:
private void btnStart_Click(object sender, EventArgs e) { //Navigation Management embedded UI Form frm = new frmList(this); frm.Show(); this.Hide(); }
This is navigational code. It is navigating the application from Form1 to frmList. I am passing Form1 to frmList; this is also for navigational purposes. When frmList is dismissed, it will now know to navigate back to Form1.
frmList has two class level variables:
//******************************** //State management in UI private ArrayList list; private Form1 frm; //********************************
These are for state and navigational management.
frmList has two extra methods in addition to the event handlers.
private void bind() { //Accesses DALC layer list = PersonData.getPersonsList(); lb.DataSource = list; } //*********MODEL & WORKFLOW BEHAVIOUR************* internal void upPerson() { CurrencyManager man = this.BindingContext[list] as CurrencyManager; if(man != null) man.Refresh(); } //************************************************
The
bind() method, makes a direct call to the Data Layer to retrieve the list of persons from the data store. The
upPerson() method will be called from frmPerson when in the
btnDone.Click event handler of frmPerson. In other words, frmPerson will have a reference of frmList passed to it.
The new Person button event handler in frmList looks like this:
private void btnNew_Click(object sender, EventArgs e) { //**********MODEL, WORK FLOW & STATE ******************** Person person = new Person(); person.ID = Guid.NewGuid().ToString(); person.isNew = true; this.list.Add(person); Form frm = new frmPerson(this, person); frm.ShowDialog(this); //****************************************************** }
In this code snippet, I am doing business processing, state management and navigation. I first create a new person object, assign it a new GUID and mark it as new � this is business processing embedded into the UI. I then add the new person to my class level
ArrayList � this is state management embedded in the UI. Finally, I instantiate a new frmPerson and pass it a reference of the new person and frmList, and then display frmPerson � this is navigation and state management, again embedded in the UI. This method for a Layered fundamentalist is blasphemy.
When an existing person is selected in frmList�s
ListBox, the event handler looks like this:
private void lb_DoubleClick(object sender, EventArgs e) { if(lb.SelectedItems.Count == 0)return; Person person = (Person)lb.SelectedItems[0]; //***************WORK FLOW & STATE if(!person.isNew) { if(person.Addresses.Count == 0)person.Addresses = AddressData.getPersonAddresses(person.ID); if(person.Contacts.Count == 0)person.Contacts = ContactData.getPersonContacts(person.ID); } Form frm = new frmPerson(this, person); frm.ShowDialog(this); //************************************ }
The first line checks whether we have selected an item in the list; if we have not we return from the method. The next line extracts the person object from the item selected. Both these lines of code belong in the UI. None of the rest of the code in this method should be in the UI.
I next check if the Person is not new; if he is not new, I check if I have retrieved his details from the data store; if I have not, I retrieve his contact and address details. This is business logic and data access logic code embedded into the UI.
I then instantiate a new frmPerson, pass it a reference of frmList and the extracted person object and navigate to frmPerson. This is state management and navigation embedded into the UI.
frmList�s btnEnd Click event handler is as follows:
private void btnEnd_Click(object sender, EventArgs e) { //***********USES DATA LAYER*************** PersonData.upList(list); frm.Visible = true; this.Close(); //***************************************** }
The code first calls the Data Layer and initiates the crucial back end process of updating the data base. Next, I show the referenced Form1 form and close frmList. Business logic and navigation is here embedded in the UI.
In this first article we have barely touched on the UIPAB. Instead, I have coded the Business and Data Layers which are going to be reused throughout. I have used a number of PP App Blocks in these layers, with the purpose of getting you used to using the App Blocks together from the start. I have given the basic UI elements and work-flow and the objective of the demo application. I then created a Windows Application Demo UI without using the UIPAB to demonstrate how domain logic and user process logic is embedded into the UI.
In the next article I will be examining the overall objective of the UIPAB and the basic UIPAB building blocks. The purpose will not be to give a thorough technical analysis (the App Block documentation does this better than I could) but, rather, to equip you with the basic knowledge and techniques to begin using the UIPAB. I will then refactor the Windows Demo from this article using UIPAB. Lastly, we will reuse the refactoring to build an identical Asp.Net Web UI.
In later articles I will delve into more features and details of the UIPAB.
I realize that this has been a particularly round-about, and long-winded way to introduce UIPAB. But, I think it should be introduced gradually. UIPAB is not for the feint hearted and if my goal is to make it the standard for all .NET UI development, I have to lay out may case carefully.
General
News
Question
Answer
Joke
Rant
Admin | http://www.codeproject.com/KB/architecture/UIPAB1.aspx | crawl-002 | refinedweb | 5,365 | 54.63 |
Sourceware Bugzilla – Bug 212
res_init(3) is undocumented
Last modified: 2012-03-08 04:36:14 UTC
The function used to rescan /etc/resolv.conf is not mentioned in the manual.
It would be nice it was documented in the official glibc documentation.
It is documented in the manpages package.
We welcome your contribution of new wording for the manual.
Do you have a suggested wording for this documentation?
Not really. I just noted the lack of documententation and wanted to make
sure it wasn't forgotten.
Not sure if it is OK to just copy from the manual page. There it is
documented like this along with several of the res_* functions.
SYNOPSIS
#include <netinet/in.h>
#include <arpa/nameser.h>
#include <resolv.h>
extern struct state _res;
int res_init(void);
[...].
Created attachment 2106 [details]
patch documents the remquo functions
Comment on attachment 2106 [details]
patch documents the remquo functions
--- manual/arith.texi 2007-11-19 12:00:50.000000000 +1100
+++ arith.texi 2007-11-24 23:03:06.000000000 +1100
@@ -1546,6 +1546,29 @@
This function is another name for @code{drem}.
@end deftypefun
+@comment math.h
+@comment ISO_C99
+@deftypefun double remquo (double @var{numerator}, double @var{denominator},
int @var{*quo})
+@comment math.h
+@comment ISO_C99
+@deftypefunx float remquof (float @var{numerator}, float @var{denominator},
int @var{*quo})
+@comment math.h
+@comment ISO_C99
+.
+@end deftypefun
+
@node FP Bit Twiddling
@subsection Setting and modifying single bits of FP values
@cindex FP arithmetic
Comment on attachment 2106 [details]
patch documents the remquo functions
this is a mistake, this patch addresses bug 4449, it also should have the first
3 leading '/' removed from the patch. Shaun
info provided | http://sourceware.org/bugzilla/show_bug.cgi?id=212 | CC-MAIN-2013-48 | refinedweb | 277 | 52.97 |
Re: [json] Guidance on standard JSON output.
Expand Messages
- On Wed, Mar 14, 2012 at 5:59 PM, Venkat M <venkat_yum@...> wrote:
> **i have a bit of experience in this area, e.g.:
>
> Now I have a standardization question.
> I currently have about 15 calls (it
> may increase). Is it advised to have a same JSON o/p pattern for all the
> calls?
>
and personally recommend using an evelope+body model, for both the requests
and response. i've tried the approach you're using (from what i
understand), and IMO it's not as scalable. It works fine for small APIs,
but i have come to prefer the extra level of an envelope for
framework/global-level properties and a payload/body for the app-level data
because it ensures that both the clients and the framework won't step on
each other's data (i.e. they have separate namespaces). The above document
demonstrates what i currently use in my various JSON back-ends. Rather than
roll your own, you might want to pick some library which already handles
such communication, leaving the client to only deal with creating the
requests and handling the responses. If you're interested, write me
off-list and i can give you a JS class i've been evolving the past several
years (and actively use on at least 5 projects) which provides a generic
client-side API for handling arbitrary JSON-based back-ends.
--
----- stephan beal
[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly. | https://groups.yahoo.com/neo/groups/json/conversations/topics/1822?viscount=-30&l=1 | CC-MAIN-2015-11 | refinedweb | 267 | 62.17 |
June 3, 2009
This article was contributed by Nathan Willis
Some programming languages forge new ground, others are refinements of
previously existing ideas, and still others tackle a specific problem in a
new and better way. This article will look at two up-and-coming languages
that are not yet as widely adopted as C, C++, or Java, but offer developers
some intriguing benefits: Vala and
Clojure. Vala is designed specifically
to build native applications for the GNOME desktop environment, and Clojure
brings the power of Lisp
and functional programming to the Java Virtual Machine (JVM).
GN.
While Vala is a language designed around a particular object system,
targeting a particular desktop environment, Clojure could not be more
different. It is a dialect of the functional-flavored programming language
Lisp,
implemented on the Java platform. That makes it cross-platform; Clojure
applications are compiled to Java bytecode, so they can run on any platform
with a well-supported JVM.
Creator Rich Hickey has explained that building on top of
the JVM grants Clojure automatic platform stability from a broad user and
developer community, but that itself was not the goal of creating the
language. Hickey's primary interest was concurrency — he wanted the
ability to write multi-threaded applications, but increasingly found the
mutable, stateful paradigm of object oriented programming to be part of the
problem. "Discovering Common Lisp after over a decade of C++, I said
to myself — 'What have I been doing with my life?', and resolved to
at some point code in Lisp. Several years of trying to make that practical,
with 'bridges' like jFli, Foil etc, made it clear that bridges weren't
going to be sufficient for the commercial work I was doing."
Hickey became less enamored of object oriented programming and started
adopting a functional-programming style in his work, which he found to make
the code more robust and easier for him and for his coworkers to
understand. Eventually, maintaining that style in other languages like C#
became more trouble than it was worth:
Clojure does provide persistent data structures, although it does
considerably more. For those unfamiliar, functional programming (the style
from which Lisp and Clojure originate) places a greater emphasis on
functions as first-class objects, meaning that functions can be placed into
data structures, passed as arguments to other functions, evaluated in
comparisons, even returned as the return value of another function.
Moreover, functions do not have "side effects" — the ability to
modify program state or data. This paradigm focuses on computation in the
mathematical sense, rather than procedural algorithms, and is a completely
different approach to programming.
As a language, Clojure is a Lisp-1, part of the same
family of Lisp variants as Scheme,
notable for sharing a single namespace between functions and variables.
Clojure differs from Scheme and other Lisp dialects in several respects documented at the Clojure web site.
For application developers, the most significant distinction is that
Clojure defaults to
making all data structures immutable. To maintain program state,.
Like other Lisp implementations, Clojure is interpreted through a console-like
read-eval-print-loop (REPL). The user launches the REPL from a .jar file
and is presented with the REPL command prompt, from which he or she can
load Clojure programs or directly write and execute functions and macros.
The code is compiled on-the-fly to Java bytecode, which is then in turn
executed by the JVM. The REPL environment is much like an interactive IDE
and debugger all rolled into one, but for distribution purposes, Clojure
code can be compiled ahead of
time into ordinary Java applications. Because it is hosted by the JVM,
Clojure can automatically make use of its features, including the type
system, thread implementation, and garbage collector, rather than having to
re-implement each of them. Clojure code can also call Java libraries, opening up
a wealth of classes and interfaces to Clojure programmers.
Clojure 1.0 was released on May
4, 2009. There are several good resources online for learning about the
language and for getting started, although a general introduction to Lisp
is probably warranted for those with no experience in functional
programming. Though there are not large-scale projects using Clojure, an
active community is growing
around it, including several local users' groups. The Clojure site offers
documentation of the language
syntax and examples (including example code), there is a very active Google
Groups discussion
forum, and Mark Volkmann's Clojure page at Object
Computing tracks articles, slides, and wikibooks about Clojure.
Vala and Clojure seem to have little if anything in common; one is
object oriented and the other functional, one aimed at a specific desktop
system and the other intentionally cross-platform. They are kindred
spirits in one sense, however — they seek to build a more modern,
robust language implementation on top of an existing, established platform.
Vala's goal is to let C programmers more easily take advantage of the power
of GObject and GNOME, and Clojure's is to let developers easily write
concurrent applications on top of the stability of the JVM.
What is equally important is that both projects maintain bi-directional
compatibility with their underlying languages and platforms. A Vala
program can use any C library, and a C program can use any library written
in Vala. Likewise, Clojure code can be compiled to Java, and Clojure
applications can use any Java class or interface. Such interoperability
will likely increase adoption of both of these languages, and it is a welcome
sight in any project.
A look at two new languages: Vala and Clojure
Posted Jun 4, 2009 0:57 UTC (Thu) by JoeBuck (subscriber, #2330)
[Link]
The resulting C compiles normally with gcc, plus it can be distributed as source packages fully usable on platforms that do not have Vala installed.
Careful. It's a nice feature that users who don't have Vala can build a program from the C output from the Vala compiler. But one of the functions of source packages is license compliance, and it's important to remember that for purposes of GPLv2 or GPLv3, the source code is defined as the preferred form for modification, thus the Vala code is the source and the C code produced by the Vala compiler is not. Vala source must be made available for license compliance.
Posted Jun 4, 2009 11:03 UTC (Thu) by njh (subscriber, #4425)
[Link]
Someone who wants to exercise "freedom 1" can do so, but will need to get a Vala development environment (much as someone who wants to do non-trival hacking on a project that includes a YACC parser will need Bison installed, but if they just want to build the program unmodified then they only need a C compiler).
Posted Jun 4, 2009 1:05 UTC (Thu) by flewellyn (subscriber, #5047)
[Link]
Ah, careful, you'll get a lot of Lispers' backs up with that one. Modern Lisps like Common Lisp and Scheme are not "interpreted". They are interactive, but most of them include compilers; the Common Lisp standard requires a minimal compiler, in fact, and many CL implementations don't have interpreters at all, instead compiling code as it's read in (to bytecode or machine code, depending).
Posted Jun 4, 2009 9:50 UTC (Thu) by wingo (guest, #26929)
[Link]
Clojure - many Lisp implementations compiled, syntax alternatives
Posted Jun 8, 2009 14:24 UTC (Mon) by dwheeler (guest, #1216)
[Link]
Quite true. Many Lisp-based implementations include compilers, and many can generate very nice code (especially if given some type hints).
Some people are put off by Lisp's syntax ((((((lots of parens, no built-in infix)))))). If you're one of them, you might want to check out this page on making Lisps readable, in particular, sweet expressions.
Posted Jun 8, 2009 15:30 UTC (Mon) by flewellyn (subscriber, #5047)
[Link]
Granted, the parens would be hard to keep track of without a good editor like Emacs, but I find the same to be true of other languages, be they braces-and-semicolon languages like C\C++\Java\PHP\Javascript\whatever, or whitespace-significant like Python. A good editor is essential no matter what.
Clojure and JVM languages
Posted Jun 4, 2009 3:18 UTC (Thu) by rfunk (subscriber, #4054)
[Link]
Posted Jun 4, 2009 6:05 UTC (Thu) by tnoo (subscriber, #20427)
[Link]
Posted Jun 4, 2009 9:03 UTC (Thu) by rwmj (subscriber, #5474)
[Link]
Posted Jun 4, 2009 11:58 UTC (Thu) by rfunk (subscriber, #4054)
[Link]
Posted Jun 4, 2009 12:45 UTC (Thu) by tnoo (subscriber, #20427)
[Link]
Transactional Memory
Posted Jun 4, 2009 4:06 UTC (Thu) by wahern (subscriber, #37304)
[Link]
Every existing STM library actually uses locks internally. Period. Please, stop the cargo cult hyperbole. The only real STM implementations are on paper, or maybe in a lab w/ a custom ASIC.
Posted Jun 4, 2009 5:18 UTC (Thu) by jamesh (guest, #1159)
[Link]
The language's home page seems to be saying that STM is the concurrency model provided to programs written in the language (and that those semantics are limited to a single type of variable).
I am sure you are correct that it is implemented via locks internally -- it'd use the primitives provided by the JVM.
Posted Jun 4, 2009 9:44 UTC (Thu) by farnz (guest, #17727)
[Link]
For those who want to be accurate about it, STM moves responsibility for locking from the application developer to the STM implementor; the contract is that STM applications cannot deadlock, and as a quality of implementation issue, should not livelock.
As with many things in programming, the hope is to trade off the possibility of more performance (given a high enough standard of programmer), for reliability now.
Posted Jun 4, 2009 13:15 UTC (Thu) by zdzichu (subscriber, #17118)
[Link]
Posted Jun 4, 2009 18:37 UTC (Thu) by wahern (subscriber, #37304)
[Link]
The Rock CPU ops would seem to mostly obviate the need for the dance.
Posted Jun 11, 2009 14:10 UTC (Thu) by tvld (subscriber, #59052)
[Link]
Posted Jun 4, 2009 14:38 UTC (Thu) by mitchskin (subscriber, #32405)
[Link]
The only real STM implementations are on paper, or maybe in a lab w/ a custom ASIC. (subscriber, .
Posted Jun 4, 2009 18:01 UTC (Thu) by ekmett (guest, #58940)
[Link]
To implement a fully lock-free STM you use an atomic n-CAS. You are correct that LL/SC or DCAS isn't available on a modern CPU directly. However, you CAN build an n-CAS out of that very same x86 cmpxchg16b-style CAS operation. The derivation isn't very straight forward, so I'm not surprised that you didn't come up with it by yourself, but a construction exists. You wind up comparing and swapping the values of n 'slots' atomically, rather than swapping n machine integers directly....
Once you have that, the derivation is straightforward.
The reason almost all transactional memory implementations fall back on ordered locks is because in practice the n-CAS STM is slower than the lock-based STM, not because no such construction exists.
<end lock-free STM cargo cult hyperbole>
Posted Jun 5, 2009 17:29 UTC (Fri) by wahern (subscriber, #37304)
[Link]
There are other DCAS algorithms, too, including (IIRC) one which is probabilistic (but strong). One problem I encountered is that early Opterons don't implement a 128-bit CAS.
Also, my particular task was implementing POSIX signals for pthreads-win32, which ruled out dynamic allocation (requiring locking) of context structures--required by many (all?) of these CAS algorithms.
Posted Jun 6, 2009 1:34 UTC (Sat) by ekmett (guest, #58940)
[Link]
But even so thats a far cry from no implementation being possible. ;)
Posted Jun 8, 2009 19:52 UTC (Mon) by wahern (subscriber, #37304)
[Link]
Should I just tell pthread-win32 users, "POSIX signals work without any trouble... just don't use more than N threads"?
That's not STM per the theory, is it? That's something very close to STM, but still requires workarounds and caveats. And w/ that attitude, Intel or AMD will never give us the hardware support that's needed.
Unless STM is simple and straightforward (which, even if the algorithm is complicated, it's _universal_, and so you won't have to roll your own everytime), then people will still mostly just _talk_ about STM rather than actually _using_ real STM, w/ the concomitant _realized_ benefits.
Posted Jun 11, 2009 12:33 UTC (Thu) by ekmett (guest, #58940)
[Link]
Posted Jun 11, 2009 8:24 UTC (Thu) by ketilmalde (guest, #18719)
[Link]
Really? I think there's a lot of talk about how STM is bollocks. While I haven't read the literature (as) extensively (as you seem to have), I've yet to see any rationale for this. More specific pointers than just a ream of research paper titles would be great.
> This is because pure STM requires the LL/SC
I'm sorry, but isn't this SOFTWARE transactional memory we're talking about? What's stopping the run-time system from abstracting away the underlying hardware?
> Every existing STM library actually uses locks internally. Period.
> Please, stop the cargo cult hyperbole. The only real STM implementations
> are on paper, or maybe in a lab w/ a custom ASIC.
While I've only made toy implementations using it, Haskell's STM library seems awfully real to me. I'm not aware of any locking, but I could be misunderstanding how it works, of course.
Further down, you go on to claim:
> Fact is, real STM does not exist.
and
> Everything else can deadlock, and can livelock
While I love unsubstianted claims as much as the next guy, your opinions would be more enlightening if you provide actual example code that demonstrates this.
Posted Jun 4, 2009 9:05 UTC (Thu) by rwmj (subscriber, #5474)
[Link]
It could have been a great step forward: type inference, non-intrusive static typing, ideas from functional languages, strong emphasis on safe programming practices ... All things which are needed by the free software community.
Instead we got a warmed-over C# clone with a syntax more verbose than
Java, and none of the innovations in language design which have happened in the past decades.
Rich.
Posted Jun 4, 2009 13:30 UTC (Thu) by walters (subscriber, #7396)
[Link]
Not clear what you mean by "safe programming"? Memory safety/garbage collection? In that case true, but it was a design goal of Vala to be independent of higher level runtimes and thus usable for lower level libraries in the stack.
Posted Jun 4, 2009 13:54 UTC (Thu) by rwmj (subscriber, #5474)
[Link]
GUI toolkits can be designed on pure functional principles, although that wasn't what I was advocating. Look up Functional Reactive Programming. There are various toolkits for Haskell implementing these techniques.
Safety is always a good thing to build into modern languages, not just because no one wants their programs to crash so much, but because in some cases it really matters - errors and inaccuracies in GUI programs can have all sorts of effects from wasted time right up to death. Languages should be designed to reduce programmer mistakes. Garbage collection is one of many techniques in this area. Others include: design contracts, modularity, strong typing, phantom types, test-driven development.
Unfortunately all of this research seems to have passed over the heads of the developers of Vala.
Posted Jun 4, 2009 14:11 UTC (Thu) by walters (subscriber, #7396)
[Link]
Type inference is possible with OO languages. Ironically recent versions of C# have a rather pathetic form of type inference.
Unfortunately all of this research seems to have passed over the heads of the developers of Vala.
You missed by point that garbage collection would have been incompatible with a key Vala design goal. It didn't "pass over their head"..
design contracts, modularity, strong typing, phantom types, test-driven development.
Vala definitely has modularity and strong typing. I'd argue test-driven development is not a language feature but a cultural feature. I'm not familiar with phantom types.
Anyways, you seem to be essentially saying that because Vala isn't OCaml it must be broken, when there are actual engineering tradeoffs that you're not recognizing.
Posted Jun 4, 2009 14:13 UTC (Thu) by rwmj (subscriber, #5474)
[Link]
Are you sure all the language developers are mad?
Posted Jun 4, 2009 19:28 UTC (Thu) by khim (subscriber, #9252)
[Link]
Sure (and what is ironic about it?), but what I am claiming it
that it's not overly useful in a heavily imperative/OO context, given that
C++/Java/C# programmers have gone many years without it.
Then why it's added to C#, C++ (gcc 4.4 at least does have it), etc? Are
you sure developers do it because they all are mad?
Eclipse does a good enough job at filling out generics right
now for me.
Yup. Basically you are using type inference - just implemented
not in compiler as sane people are doing but in editor. And it produces
tons of useless clutter because it's implemented in wrong place..
Why is it a disaster? You can combine compiled Java code (GCJ) and
Scheme code (Guile) in a single process - and everything "just works".
Sure, it's not exactly super-fast (you are scanning some small regions of
memory twice), but no other problems are shown...
Anyways, you seem to be essentially saying that because Vala
isn't OCaml it must be broken, when there are actual engineering tradeoffs
that you're not recognizing.
Nope. If you want to see the language designed around existing
OO-system, but which is done right - take look on Groovy. It's not perfect
(no
language is perfect) but it adds a lot of usefull features to Java while
reusing the same JVM. Sure, JVM does have richer set of features if
you compare it with GLib/GObject, but still the Vala is pretty pathetic
language.
Posted Jun 5, 2009 18:53 UTC (Fri) by amaranth (subscriber, #57456)
[Link]
var reader = new Reader ();
Posted Jun 4, 2009 14:01 UTC (Thu) by alankila (subscriber, #47141)
[Link]
With a C# keyword like "var" you can make the type information implicit, which makes it easier to write and change the code. Plus there's just something about:
Reader reader = new Reader()
collapsing to:
var reader = new Reader()
that makes the code much more readable to me. It's removing the type information that looks and feels like noise to me.
Then again, when there's a typo somewhere and the compiler can't figure out what the implicit type stands for, the errors that result are almost incomprehensible. I'm hoping Mono people can fix the parser to abort earlier instead of filling "var" with "object" and proceeding until it crashes and burns 5 lines later with missing methods and wrong types for calls etc. Usually the first thing to debug problems like this is to add some type information back so you'll pínpoint the line where it goes wrong.
Posted Jun 4, 2009 13:23 UTC (Thu) by NAR (subscriber, #1313)
[Link]
Famouos last words :-) Erlang doesn't have mutable variables, so there's no need to use locks, still it's fairly easy to introduce deadlocks and race conditions as long as there's message passing between threads.
Posted Jun 6, 2009 14:03 UTC (Sat) by aanno (subscriber, #6082)
[Link]
Transactional Memory does not require functional languages
Posted Jun 11, 2009 14:17 UTC (Thu) by tvld (subscriber, #59052)
[Link]
Posted Jun 17, 2009 6:53 UTC (Wed) by j1m+5n0w (guest, #20285)
[Link]
Linux is a registered trademark of Linus Torvalds | http://lwn.net/Articles/335966/ | CC-MAIN-2013-48 | refinedweb | 3,306 | 57.1 |
0
helo,
I learn Classes and methods according to a manual "Think Python: How to Think Like a Computer Scientist"
I am stuck on "Polymorphism" There is a part using built-in function sum.
I don't know what to do... It should be connected to __add__ function, but still the code must be somhow changed. If I use just total=t1+t2+t3 it works.
Here is a link to a web manual:
total=sum([t1,t2,t3])
here is a code:
def int_to_time(seconds): time = Time() minutes, time.second = divmod(seconds, 60) time.hour, time.minute = divmod(minutes, 60) return time class Time(object): def __init__(self, hour=0, minute=0, second=0): self.hour = hour self.minute = minute self.second = second def __add__(self, other): seconds = self.time_to_int() + other.time_to_int() return int_to_time(seconds) def time_to_int(self): minutes = self.hour * 60 + self.minute seconds = minutes * 60 + self.second print seconds return seconds def __str__(self): return '%.2d:%.2d:%.2d' % (self.hour, self.minute, self.second) def main(): t1 = Time(7, 43) t2 = Time(7, 41) t3 = Time(7, 37) total = sum([t1, t2, t3]) print total if __name__ == '__main__': main()
I really approciate your help guys. Many thanks!
Edited by vlady: n/a | https://www.daniweb.com/programming/software-development/threads/394069/polymorphism | CC-MAIN-2017-34 | refinedweb | 205 | 61.12 |
learning Scalaz: day 6
Hey there. There's an updated html5 book version, if you want..
for syntax again
There's a subtle difference in Haskell's
do notation and Scala's
for syntax. Here's an example of
do notation:
foo = do x <- Just 3 y <- Just "!" Just (show x ++ y)
Typically one would write
return (show x ++ y), but I wrote out
Just, so it's clear that the last line is a monadic value. On the other hand, Scala would look as follows:
scala> def foo = for { x <- 3.some y <- "!".some } yield x.shows + y
Looks almost the same, but in Scala
x.shows + y is plain
String, and
yield forces the value to get in the context. This is great if we have the raw value. But what if there's a function that returns monadic value?
in3 start = do first <- moveKnight start second <- moveKnight first moveKnight second
We can't write this in Scala without extract the value from
moveKnight second and re-wrapping it using yeild:
def in3: List[KnightPos] = for { first <- move second <- first.move third <- second.move } yield third
This difference shouldn't pose much problem in practice, but it's something to keep in mind.
Writer? I hardly knew her!
Learn You a Haskell for Great Good says:
Whereas the
Maybemonad is for values with an added context of failure, and the list monad is for nondeterministic values,
Writermonad is for values that have another value attached that acts as a sort of log value.
Let's follow the book and implement
applyLog function:
scala> def isBigGang(x: Int): (Boolean, String) = (x > 9, "Compared gang size to 9.") isBigGang: (x: Int)(Boolean, String) scala> implicit class PairOps[A](pair: (A, String)) { def applyLog[B](f: A => (B, String)): (B, String) = { val (x, log) = pair val (y, newlog) = f(x) (y, log ++ newlog) } } defined class PairOps scala> (3, "Smallish gang.") applyLog isBigGang res30: (Boolean, String) = (false,Smallish gang.Compared gang size to 9.)
Since method injection is a common use case for implicits, Scala 2.10 adds a syntax sugar called implicit class to make the promotion from a class to an enriched class easier. Here's how we can generalize the log to a
Monoid:
scala> implicit class PairOps[A, B: Monoid](pair: (A, B)) { def applyLog[C](f: A => (C, B)): (C, B) = { val (x, log) = pair val (y, newlog) = f(x) (y, log |+| newlog) } } defined class PairOps scala> (3, "Smallish gang.") applyLog isBigGang res31: (Boolean, String) = (false,Smallish gang.Compared gang size to 9.)
Writer
LYAHFGG:
To attach a monoid to a value, we just need to put them together in a tuple. The
Writer w atype is just a
newtypewrapper for this.
In Scalaz, the equivalent is called
Writer:
type Writer[+W, +A] = WriterT[Id, W, A]
Writer[+W, +A] is a type alias for
WriterT[Id, W, A].
WriterT
Here's the simplified version of
WriterT:
sealed trait WriterT[F[+_], +W, +A] { self => val run: F[(W, A)] def written(implicit F: Functor[F]): F[W] = F.map(run)(_._1) def value(implicit F: Functor[F]): F[A] = F.map(run)(_._2) }
It wasn't immediately obvious to me how a writer is actually created at first, but eventually figured it out:
scala> 3.set("Smallish gang.") res46: scalaz.Writer[String,Int] = scalaz.WriterTFunctions$$anon$26@477a0c05
The following operators are supported by all data types enabled by
import Scalaz._:
trait ToDataOps extends ToIdOps with ToTreeOps with ToWriterOps with ToValidationOps with ToReducerOps with ToKleisliOps
The operator in question is part of
WriterV:
trait WriterV[A] extends Ops[A] { def set[W](w: W): Writer[W, A] = WriterT.writer(w -> self) def tell: Writer[A, Unit] = WriterT.tell(self) }
The above methods are injected to all types so we can use them to create Writers:
scala> 3.set("something") res57: scalaz.Writer[String,Int] = scalaz.WriterTFunctions$$anon$26@159663c3 scala> "something".tell res58: scalaz.Writer[String,Unit] = scalaz.WriterTFunctions$$anon$26@374de9cf
What if we want to get the identity value like
return 3 :: Writer String Int?
Monad[F[_]] expects a type constructor with one parameter, but
Writer[+W, +A] takes two. There's a helper type in Scalaz called
Monad
LYAHFGG:
Now that we have a
Monadinstance, we're free to use
donotation for
Writervalues.
Let's implement the example in Scala:
scala> def logNumber(x: Int): Writer[List[String], Int] = x.set(List("Got number: " + x.shows)) logNumber: (x: Int)scalaz.Writer[List[String],Int] scala> def multWithLog: Writer[List[String], Int] = for { a <- logNumber(3) b <- logNumber(5) } yield a * b multWithLog: scalaz.Writer[List[String],Int] scala> multWithLog.run res67: (List[String], Int) = (List(Got number: 3, Got number: 5),15)
Adding logging to program
Here's the
gcd example:
scala> :paste // Entering paste mode (ctrl-D to finish) def gcd(a: Int, b: Int): Writer[List[String], Int] = if (b == 0) for { _ <- List("Finished with " + a.shows).tell } yield a else List(a.shows + " mod " + b.shows + " = " + (a % b).shows).tell >>= { _ => gcd(b, a % b) } // Exiting paste mode, now interpreting. gcd: (a: Int, b: Int)scalaz.Writer[List[String],Int] scala> gcd(8, 3).run res71: (List[String], Int) = (List(8 mod 3 = 2, 3 mod 2 = 1, 2 mod 1 = 0, Finished with 1),1)
Inefficient List construction
LYAHFGG:
When using the
Writermonad, you have to be careful which monoid to use, because using lists can sometimes turn out to be very slow. That's because lists use
++for
mappendand using
++to add something to the end of a list is slow if that list is really long.
Here's the table of performance characteristics for major collections. What stands out for immutable collection is
Vector since it has effective constant for all operations.
Vector is a tree structure with the branching factor of 32, and it's able to achieve fast updates by structure sharing.
For whatever reason, Scalaz 7 does not enable typeclasses for
Vectors using
import Scalaz._. So let's import it manually:
scala> import std.vector._ import std.vector._ scala> Monoid[Vector[String]] res73: scalaz.Monoid[Vector[String]] = scalaz.std.IndexedSeqSubInstances$$anon$4@6f82f06f
Here's the vector version of
gcd:
scala> :paste // Entering paste mode (ctrl-D to finish) def gcd(a: Int, b: Int): Writer[Vector[String], Int] = if (b == 0) for { _ <- Vector("Finished with " + a.shows).tell } yield a else for { result <- gcd(b, a % b) _ <- Vector(a.shows + " mod " + b.shows + " = " + (a % b).shows).tell } yield result // Exiting paste mode, now interpreting. gcd: (a: Int, b: Int)scalaz.Writer[Vector[String],Int] scala> gcd(8, 3).run res74: (Vector[String], Int) = (Vector(Finished with 1, 2 mod 1 = 0, 3 mod 2 = 1, 8 mod 3 = 2),1)
Comparing performance
Like the book let's write a microbenchmark to compare the performance:
import std.vector._ def vectorFinalCountDown(x: Int): Writer[Vector[String], Unit] = { import annotation.tailrec @tailrec def doFinalCountDown(x: Int, w: Writer[Vector[String], Unit]): Writer[Vector[String], Unit] = x match { case 0 => w >>= { _ => Vector("0").tell } case x => doFinalCountDown(x - 1, w >>= { _ => Vector(x.shows).tell }) } val t0 = System.currentTimeMillis val r = doFinalCountDown(x, Vector[String]().tell) val t1 = System.currentTimeMillis r >>= { _ => Vector((t1 - t0).shows + " msec").tell } } def listFinalCountDown(x: Int): Writer[List[String], Unit] = { import annotation.tailrec @tailrec def doFinalCountDown(x: Int, w: Writer[List[String], Unit]): Writer[List[String], Unit] = x match { case 0 => w >>= { _ => List("0").tell } case x => doFinalCountDown(x - 1, w >>= { _ => List(x.shows).tell }) } val t0 = System.currentTimeMillis val r = doFinalCountDown(x, List[String]().tell) val t1 = System.currentTimeMillis r >>= { _ => List((t1 - t0).shows + " msec").tell } }
We can now run this as follows:
scala> vectorFinalCountDown(10000).run res18: (Vector[String], Unit) = (Vector(10000, 9999, 9998, 9997, 9996, 9995, 9994, 9993, 9992, 9991, 9990, 9989, 9988, 9987, 9986, 9985, 9984, ... scala> res18._1.last res19: String = 1206 msec scala> listFinalCountDown(10000).run res20: (List[String], Unit) = (List(10000, 9999, 9998, 9997, 9996, 9995, 9994, 9993, 9992, 9991, 9990, 9989, 9988, 9987, 9986, 9985, 9984, ... scala> res20._1.last res21: String = 2050 msec
As you can see
List is taking almost double the time.
Reader
LYAHFGG:
In the chapter about applicatives, we saw that the function type,
(->) ris an instance of
Functor.
scala> val f = (_: Int) * 5 f: Int => Int = <function1> scala> val g = (_: Int) + 3 g: Int => Int = <function1> scala> (g map f)(8) res22: Int = 55
We've also seen that functions are applicative functors. They allow us to operate on the eventual results of functions as if we already had their results.
scala> val f = ({(_: Int) * 2} |@| {(_: Int) + 10}) {_ + _} warning: there were 1 deprecation warnings; re-run with -deprecation for details f: Int => Int = <function1> scala> f(3) res35: Int = 19
Not only is the function type
(->) r afun.
Let's try implementing the example:
scala> val addStuff: Int => Int = for { a <- (_: Int) * 2 b <- (_: Int) + 10 } yield a + b addStuff: Int => Int = <function1> scala> addStuff(3) res39: Int = 19
Both
(*2)and
(+10)get applied to the number
3in this case.
return (a+b)does as well, but it ignores it and always presents
a+bas the result. For this reason, the function monad is also called the reader monad. All the functions read from a common source.
Essentially, the reader monad lets us pretend the value is already there. I am guessing that this works only for functions that accepts one parameter. Unlike
Option and
List monads, neither
Writer nor reader monad is available in the standard library. And they look pretty useful.
Let's pick it up from here later. | http://eed3si9n.com/learning-scalaz-day6 | CC-MAIN-2018-47 | refinedweb | 1,627 | 74.9 |
Note: MovieTexture is due to be deprecated in a future version of Unity. You should use VideoPlayer for video download and movie playback.
Movie Textures are animated TexturesAn image used when rendering a GameObject, Sprite, or UI element. Textures are often applied to the surface of a mesh to give it visual detail. More info
See in Glossary that are created from a video file. By placing a video file in your project’s Assets Folder, Quicktime from Apple Support Downloads.
The Movie Texture InspectorA Unity window that displays information about the currently selected GameObject, Asset or Project Settings, alowing you to inspect and edit the values. More info
See in Glossary is very similar to the regular Texture Inspector.
When a video file is added to your Project, it will automatically be imported and converted to Ogg Theora format. Once your Movie Texture has been imported, you can attach it to any GameObjectThe fundamental object in Unity scenes, which can represent characters, props, scenery, cameras, waypoints, and more. A GameObject’s functionality is defined by the Components attached to it. More info
See in Glossary or MaterialAn asset that defines how a surface should be rendered, by including references to the Textures it uses, tiling information, Color tints and more. The available options for a Material depend on which Shader the Material is using. More info
See in Glossary, just like a regular Texture.
Your Movie Texture will not play automatically when the game begins running. You must use a short script to tell it when to play.
// this line of code will make the Movie Texture begin playing ((MovieTexture)GetComponent<Renderer>().material.mainTexture).Play();
Attach the following script to toggle Movie playback when the space bar is pressed:
public class PlayMovieOnSpace : MonoBehaviour { void Update () { if (Input.GetButtonDown ("Jump")) { Renderer r = GetComponent<Renderer>(); MovieTexture movie = (MovieTexture)r.material.mainTexture; if (movie.isPlaying) { movie.Pause(); } else { movie.Play(); } } } }
For more information about playing Movie Textures, see the Movie Texture Script Reference page
When a Movie Texture is imported, the audio track accompanying the visuals are imported as well. This audio appears as an AudioClip child of the Movie Texture.
To play this audio, must be attached to a GameObject, like any other Audio Clip. Drag the Audio Clip from the Project ViewA view that shows the contents of your Assets folder (Project tab) More info
See in Glossary onto any GameObject in the SceneA Scene contains the environments and menus of your game. Think of each unique Scene file as a unique level. In each Scene, you place your environments, obstacles, and decorations, essentially designing and building your game in pieces. More info
See in Glossary or Hierarchy View. Usually, this will be the same GameObject that is showing the Movie. Then use audio.Play() to make the the movie’s audio track play along with its video.
Movie Textures are not supported on iOSApple’s mobile operating system. More info
See in Glossary...
Did you find this page useful? Please give it a rating: | https://docs.unity3d.com/Manual/class-MovieTexture.html | CC-MAIN-2019-30 | refinedweb | 505 | 57.37 |
Event Details
The R development master class will help you write better code, focussed on the mantra of "do not repeat yourself". In day one you will learn powerful new tools of abstraction, allowing to solve a wider range of problems with fewer lines of code. Day two will teach you how to make packages, the fundamental unit of code distribution in R, allowing others to save time by allowing them to use your code.
Day 1: Advanced programming techniques - Dec 12th (9am-5pm)
Becoming a skilled R programmer requires you to master new techniques of abstraction, particularly techniques that come from R's functional heritage. Mastering these techniques will allow you to solve harder problems with fewer lines of code.
First class functions.
Topics: Anonymous functions. Functions that write functions (closures). Functions that take functions as arguments (higher-order function). Storing functions in data structures.
R has first order functions: In this session, you'll learn how to use these abilities to write effective code.
Controlling evaluation.
Topics: Quoting. Evaluating. Scoping. Lazy evaluation. Computing on the language
One of the neat things about R is how it gives you much more control over evaluation than other programming languages. In this session, you'll learn how functions like `subset` and `transform` work. You'll also learn common pitfalls of these techniques and how to avoid them in your own code. I'll conclude with a brief exploration of R functions that let you modify R code.
Object oriented programming in R.
Topics: S3. S4. Reference classes.
OO is a useful technique for organising large amounts of code in a way that makes it easier to understand. In this session, you will learn about the three object oriented systems in base R. I will focus mainly on S3 and S4, as they are the most different to OO-systems you are probably familiar, and are so important for understanding existing R code. I'll touch on the new reference classes, which provide a framework much more like Java or C#.
Development best practices
Topics: Correct code. Maintainable code. Fast code.
Day one will conclude with a survey of development best-practices including a discussion of code style, commenting, profiling, improving performance and testing. We'll touch on the new byte-code compiler in R, and on writing high-performance code in C++ with the Rcpp package.
Day 2: Package development - Dec 13th (9am-5pm)
Packages are the fundamental unit of distributable R code. They include reusable R functions, the documentation that describes how to use them, sample data and much much more. On day two you'll learn how to turn your code into packages that others can easily download and use. Writing a package can seem overwhelming at first, but we'll start with the basics, and show you the packages that will help you get up and running as quickly as possible. You'll learn from the mistakes I've made writing over 20 R packages, and learn the tools that make package development and maintenance as simple as possible.
Introduction to package development
Topics: Overview of package structure. The devtools package. Reading the source.
A great way to improve your R and package development skills is to inspect the packages that others have developed. We'll focus on the stringr, lubridate, and plyr packages to show off various aspects of package development and programming in the large
Playing well with others
Topics: Documentation. Namespaces. The roxygen package.
Your package is not an island alone, it must be able to integrate into the existing R ecosystem. In this session we'll cover documentation (at both the package and function levels), so that new users can get up and running with your package quickly, and namespaces, which help make sure your package doesn't interfere with other packages the user might have loaded.
Ensuring correctness with unit testing.
Topics: Testing philosophy. Unit testing. The testthat package.
To trust that you package is working correctly
Releasing your package into the wild.
Topics: `R CMD check`. Releasing on CRAN and the release cycle. Source code control. Community management.
Once you have your package working, you need to make sure it passes all automated testing and release it to CRAN. In this session, you'll learn how to effectively deal with the frustration of `R CMD check` and other important steps in the release process. We'll conclude with some pointers on developing a vibrant community around your package.
Discounts
We have limited student (66% off) and academic (33% off) discounts available. Please contact Hadley directly for details and to verify your status.
Date of purchase to Nov 28, 2012 - Full refund less 10% of the paid ticket price
Nov 29 to Dec 4, 2012 - 50% of paid ticket price
On or after Dec 5, 2012 - Non refundable
When & Where
Morgan Stanley Conference Center
750 7th Avenue
Room 750-5FG
New York,
NY 10019
Monday, December 12, 2011 at 9:00 AM - Tuesday, December 13, 2011 at 5:00 PM (EST)
Add to my calendar
Organizer
Hadley Wickham
Sponsored by Revolution Analytics, Inc.
Share R Development Master Class - NYCShare Tweet | http://www.eventbrite.com/e/r-development-master-class-nyc-tickets-2492641558 | CC-MAIN-2015-06 | refinedweb | 857 | 63.09 |
Journal tools |
Personal search form |
My account |
Bookmark |
Search:
...bling bracelet, $15 Additional: $1 for normal mail / $3.24 for registered mail...19 June (Friday). PRICE $16 shipped (normal mail) $19.24 shipped (registered mail...Leave a comment here (with e-mail address) with the following details: ... (normal/registered) Mailing details (name & address) After I've verified payment, ... until we are able to verify your payment. We seek your ...
...
2 liter water rocket
mg logic e pad driver
oblios in chat personal ... music concerts nyc
white house e mail address
beauty supply myrtle beach
play dollars
wheel arch angels location
networking ...
new spain maps
classification job
please verify that the current setting of session.... school
2005 bar exam florida result
mail machine supply
2005 bargain ebay find ...
... 1
oregon fence company
california corporation verify
ring and pinion contact pattern
physical ... exams
ohio sandusky waterparks
automatic private address xp
washington carpenter union
late period...ii
new jersey immunization schedule
microsoft e reader
name plates flames
and shes... teacher
private label teas
access e mail personal yahoo
california motorcycle ...
The e-mail I'd sent to the Bev!Mo store address went unanswered, so I sent it a second time a ... their machine and so they had no way to truly verify the ID, and b) told us that we looked young ...'ve helped a lot. 4. The regional manager is going to send me an e-mail that I can print out and take to Bev!... manager apparently reamed for not getting back to my e-mails, is going to send me a $25 gift ...
... gain celexa
naked pictures of russian mail order brides
open arms mp3 journey... health doctors
smoky mountain park map
mail order mens clothes
vincent depaul chicago... miguel sinaloa
anime cellphone wallpaper
education verify
wrought iron candle sconce
gallery gorgeous...san schedule
lincoln giving the gettysburg address
steven ehrlich architects
low mortgage interest...
...governor schwarzenegger education
worksite fitness program
reconfigure mail support outlook 2000
speedway convenience store
...
men in early childhood education
import address book to outlook express
job application ... smith arkansas
cyber clothing glasgow
verify e mail addresses
arkansas athletics tech university
illinois lawyer find
administration business course ...
... the idea LiveJournal can sometimes manually verify the identity of somebody who's...be permitted to reset the e-mail address and password of the ... the journal will receive an e-mail informing the user that ... be sent to the new address informing the user that they've... lose access to your e-mail address.)
An ordered list of ... involved
Possibility for someone (i.e., ex-spouse/SO) hijacking accounts ...
...naruto 122 bittorrents
muscular woman
canadian mail order pharmacy
mp3
uae
topless dancers ... clips
university in london
birthday greeting e card
ice cube on nipples videos...earth view crack
get someones e mail address
free manuals
big butts free
misha omar pulangkan video
ambien book...carlson
sexy fat women
license michigan verify
jaws for windows torrent
labtec webcam...
Address Verification
Verifying E Mail Address
Background Check
Bulk Email
How To Verify E Mail Address For Msn Messenger
California Corporation Verify
Msn Verify E Mail Address
Check
Credit Card Software
Searching For An E Mail Address
Find A Person E Mail Address
Free
Find E Mail Address
Java Byte Verify
Finding E Mail Address
Java Byte Verify Virus
Forgot My E Mail Address
Result Page:
1
2
3
4
5
6
for Verify E Mail Address | http://www.ljseek.com/Verify-E-Mail-Address_s4Zp1.html | crawl-002 | refinedweb | 567 | 58.99 |
Red Hat Bugzilla – Bug 110655
param.h should include <unistd.h>
Last modified: 2007-11-30 17:10:33 EST
Description of problem:
/usr/include/asm/param.h (included in glibc-kernheaders-2.4-8.36)
defines HZ as sysconf(_SC_CLK_TCK) but doesn't include unistd.h, where
the _SC_CLK_TCK is defined. This at least breaks the compilation of
graphviz 1.10.
To Fix: apply this patch
@@ -2,6 +2,7 @@
#define _ASMi386_PARAM_H
#ifndef HZ
+#include <unistd.h>
#define HZ sysconf(_SC_CLK_TCK)
#endif
Version-Release number of selected component (if applicable):
glibc-kernheaders-2.4-8.36
How reproducible:
Steps to Reproduce:
1.
2.
3.
Actual results:
Expected results:
Additional info:
I'd like to make the observation that this change (now appearing in
glibc-kernheaders-2.4-8.41) breaks the compilation of inetutils-1.4.2
from
revoke.c:15: error: conflicting types for `revoke'
/usr/include/unistd.h:810: error: previous declaration of `revoke'
make[2]: *** [revoke.o] Error 1
This would suggest that the change may be bogus. Or it may just mean
the inetutils package is broken.
inetutils is broken I suspect; after all why include a private kernel
header if you can't deal with a posix namespace...
Yep, I've looked into it a bit deeper. Your suspicions are correct.
This header change just exposed a latent bug in inetutils methinks.
Every other package I've compiled so far has been fine. Sorry for
wasting your time.
This issue has been fixed in glibc-kernheaders from at least release
2.4-8.41. | https://bugzilla.redhat.com/show_bug.cgi?id=110655 | CC-MAIN-2017-04 | refinedweb | 260 | 54.29 |
pthread_self - obtain ID of the calling thread
Synopsis
Description
Return Value
Errors
Conforming To
Notes
See Also
Colophon
#include <pthread.h>
pthread_t pthread_self(void);
Compile and link with -pthread.
The pthread_self() function returns the ID of the calling thread. This is the same value that is returned in *thread in the pthread_create(3) call that created this thread.
This function always succeeds, returning the calling threads ID.
This function always succeeds.
POSIX.1-2001.
POSIX.1 allows an implementation wide freedom in choosing the type used to represent a thread ID; for example, representation using either an arithmetic type or a structure is permitted. Therefore, variables of type pthread_t cant portably be compared using the C equality operator (==); use pthread_equal(3) instead.
Thread identifiers should be considered opaque: any attempt to use a thread ID other than in pthreads calls is nonportable and can lead to unspecified results.
Thread IDs are only guaranteed to be unique within a process. A thread ID may be reused after a terminated thread has been joined, or a detached thread has terminated.
The thread ID returned by pthread_self() is not the same thing as the kernel thread ID returned by a call to gettid(2).
pthread_create(3), pthread_equal(3), pthreads(7)
This page is part of release 3.44 of the Linux man-pages project. A description of the project, and information about reporting bugs, can be found at. | http://manpages.sgvulcan.com/pthread_self.3.php | CC-MAIN-2017-09 | refinedweb | 235 | 64.91 |
Take that, Python.
Yes,?
I’ve finally seen the attraction of modern day Python: It’s not the language itself, but the vast array of things Python has its hooks into and which Python – like PHP – gives you sudden and wonderful access to.
Sudden and wonderful because the APIs are usually very clean, while my beloved Perl requires you to perform gymnastic semantics to get things up and running.
With Perl, you pay up front for smoother sailing down the line – you get more mileage out of your Perl “use” than your Python “import”, in the long run. Python programmers just find the next module to “import” and accept bloat instead of leg).
Python does’t have anything that truly compares with what CPAN was in its heyday. Any 3 Python programmers can give you 5 or more different ways to “easily” get modules on your system, which will work wonderfully for about 15% of the modules you’re going to wind up trying to install.
But I’ve yet to run into a Python module that introduced anything like the nightmarish dependency trees that some basic CPAN modules have thrown at me lately.
There is still, for me, the issue that the Python language is kind of awful.
Lua and Python are both capable of “supporting OOP”, the way the average human colon is capable of “support a pool cue”. In Lua it means pissing about with metatables.
Both languages strive for cleanliness of presentation. If you write really, really simple code, both languages pull this off quite nicely. But the moment you start trying to do anything not utterly-freaking-trivial all kinds of syntactic excrement crawls out of the woodwork.
Python started out by trying to reduce the amount of markup symbols being used, to make the code look more like text. In C/C++/Java you end a given code statement with a semicolon (;). In Python, just you hit return.
// C version printf("Hello world\n") ;
# Python version print("Hello world\n")
You can also use semicolons in Python, but the end-of-line character doubles as an end-of-statement character.
In most cases…
And herein is the rub for me, Python is sometimes smart enough to determine that you can’t possibly have finished a statement, such as
# This will work... listOfThings = [ 'tea', 'milk', 'cookies' ] # This won't emptyList = [ ] # You'd have to write this emptyList = \ [ ].
For me the next issue is the whole indentation stuff. Python uses white space counts (how many spaces or tabs infront of a line) to tell when you are continuing lines of text.
We humans do this with written text, for example in email we indent quotes and we distinguish between quote and reply by levels of indentation.
The trouble is, you’re not quoting someone else’s replies here, you are creating the whole thing.
My first take on this has been: Well then make sure you don’t have lots and lots of levels of indentation in your code; make copious use of subroutines.
Sadly: Python has a really expensive overhead for function calls.
The indentation concept works fine when you have only one or two levels, but when you start getting to 6 and more, it actually starts to get a bit difficult to track what indentation level is where, or where you *intended* for indentation to be.
Going back to the mail-quoting analogy, very few people use *just* white space for quoting replies. Most people use some kind of markup, a “> ” or a “| ” or some fancy HTML indentation.
Go dig up a deep-quoting email from your inbox and strip out the markup and look at as just pure white-space indented text and try following that. Bet you’re scratching your head within a few minutes. And yet, Python programmers voluntarily inflict this upon themselves for writing mission-critical computer code. OMFG.
if something that you need to test for the start condition: if not assignedValue: if AlternateCalculationAvailable(): assignedValue = AlternateCalculation() if not assignedValue: assignedValue = ThirdCalculation() if not assignedValue: assignedValue = DatabaseValue() if not assignedValue: assignedValue = DefaultValue() if assignedValue > MinimumValue(): if assignedValue >MaximumValue(): assignedValue = MaximumValue() if assignedValue < MinimumAllowedValue(): alternateValue = CalcluateForMinimum(assignedValue)
Now – did I mean for that last test to be out-dented so many levels? Ok – that code is contrived, but I’ve seen plenty of code that looks like it. It’s *begging* for some way to allow you to more easily define scope levels, other than functions.
Lastly, I find the Python language to be crazily out of touch with it’s own paradigm of clean looking code: when laziness has won over, Python resorts to symbols; when verbosity has won over, Python resorts to serious verbosity.
Python uses the “:” character to separate pairs of items. It’s consistent about this through the language. To specify characters 5 thru 10 of “theString”, you write theString[5:10], for a dictionary (hash) you write hash = { ‘a’:1 } etc.
And so it uses it also between a conditional and compound statement, between a function/class declaration and the body. While this particular nuance of language design makes sense if you burrow that deep into the design process, it contravenes the “cleanliness” element.
# Actual python if skyColor() == 'blue' : print("Sky is blue") # Lua code if skyColor() == 'blue' then print("Sky is blue") end
For function and class definitions, it does make a sort of sense. It comes close to following the everyday English usage of the semicolon character,
Exhibit A:
class Waffles: # here's the definition of class Waffles def __init__(self): # Kinda abandoned the whole readable code here? # Print the list of items in somelist, one per line. for item in somelist.items(): print(item)
I can sort of see how it works with that for, and it does look nice when you’re writing short lines of code.
But – and this is the meat of this particular argument – in a language that is going out of its way to avoid symbols like ‘;’, the ‘:’ becomes errant and elusive in particularly long or complex statements.
It also introduces a somewhat silly seeming input dependency, consider, in the case of “def” (function definition), it means you have to type two end of statement characters: the colon and the carriage return. DUH.
This last is perhaps so that you can do
def foo(): print("foo()")
Ok, I guess I can see that, but it seems that the more common case should accept the following (note: no colon)
def foo() print("Foo")
For the more complex uses – if, for, while etc, Python ought to revert to cleanilness:
# One liner. for label in labels.items() do print(label) # Compound version. for label in labels.items() print(label)
Worst offender, the Python ternary operator:
# If the user typed 'hello' then respond 'world', otherwise 'hi'. response = 'world' if input == 'hello' else 'hi'
(Note: suddenly Python can do “if” and “else” without colons, even handling both on one line???)
Now, while some argue the ternary operator is bad, I think that in attempting to avoid recreating the evil of
response = (input == 'hello' ? 'world' : 'hi')
Python created their very own special evil. In particular, this is a case where English would mandate some form of punctuation to help stipulate the precedence. The first alternative would have been to employ consistency:
response = if input == 'hello': 'world' else: 'hi'.
But given the way they did implement, there is a clear argument for allowing the following in Python:
if input == 'hello' response = 'world' else response = 'hi'
Perhaps the reason this is not done is to help the author/viewer to distinguish the conditional clause (” input == ‘hello’ “) from the effector (” response = ‘world’ “). Many languages use parentheses to do this:
// Javascript if ( input == 'hello' ) response = 'world' ;
Python’s solution for the ternary operation is just a rabbit hole of badness.
# Does the if apply to "namespace + '::' + name" # or just to name? fullname = namespace+'::'+name if namespace else name # Inverted version, even more confusing. # Is the programmer trying to prefix name with name:: # when no namespace is present?" fullname = name if not namespace else namespace + '::' + name # Here another programmer tries desperately to # state that he wants either "name" or "namespace::name" fullname = name if not namespace else namespace+'::'+name # (apparently, he thinks python uses lack of spaces to # denote increased precedence).
I was really getting into this post, then it abruptly ended. Part 2 soon?
Maybe… Mostly I just ran out of concrete things to criticize Python for. As evidenced by the fact I’m actively using it now. I’m liking the ease with which you can “get stuff done”, but wincing at the semantics of the language every now and).”
You don’t need to use packaged CPAN moudle or bundled Perl.
will save you.
The up-an-coming CPAN of Python world is PyPI. People seem to be converging on deployment of software written in Python using virtualenv. It allows one to separate environments of applications from each other, and PyPI (i.e. easy_install or pip) is the easiest and most global source for packages to install into that isolated environment.
What packages have you found to be missing?
Just wondering aloud, have you contributed any code to CPAN? Any tests? Any documenation? If not, why not?
Camel:
Nope. Nope. Nope.
Why not? Because when I used Perl, 7-8 years ago, CPAN was always on the ball, and there was little I could contribute.
Then I had a ~7 year lull of very little Perling (back to C/C++ for the most part, and Lua for scripting).
In the last year or so, when I actively tried to use Perl again, the handful of CPAN modules that could have saved me time appeared to have been abandoned, and on investigation of whether there was anything I could do, they were so bloated in terms of excess functionality and dependencies that I had no interest in picking them up.
Gabor: Totally missing the point there. CPAN used to rock because it didn’t need things like those. CPAN never stopped rocking, but OS bundlers like RedHat generally broke CPAN by distributing CPAN-unaware Perl bundles.
Remember, CPAN tracks dependencies. Doing something like updating LWP through CPAN becomes a nuisance when you have random-CPAN-built-but-RPM-installed LWP sitting in the system directory. You start your update and the dependency list becomes longer and longer and longer and longer and suddenly you’ve been at this for nearly an hour and … oh dear, the version of something really mundane is incompatible and now CPAN is talking about installing a whole new build of Perl.
If you’ve been lucky enough not to experience this, then it’s perhaps because you’ve kept upto-date with Perl. If you haven’t then that’s where you run into the wall of hurt and – while not CPANs fault – creates the feedback look of decay as developers get lazy and start worrying only about a RPM or DEB distribution of their module and the CPAN one becomes abandoned, and users start to follow.
And about the time all this was happening was when Python was blossoming, so maybe python-pan failed to get off the ground for the same reason.
However: the end result of this, in my experience and that of a few others I’ve spoken with, is that the lack of an absolute singular python source like Perl’s CPAN means that the Python RPM/DEB modules tend to be much better maintained.
Of course, in the case of both Python and Perl, people seem to be rapidly drifting towards github, which might ultimately prove to be a good thing for both languages and their users.
Also, Camel, the quote you quoted, re-read this particular piece:
There are itty-bitty little CPAN modules for all kinds of stuff, and I’ve no interest in contributing to that issue with itty-bitty “workaround” and “hack” modules that I’m sure as heck not going to maintain because I need them to make Script X work and then never look at it again. I believe the fact that so many people have done exactly that – regardless of the language – contributes to the general decay of all these kinds of centralized repositories, from sourceforge to cpan.
> Lua and Python are both capable of “supporting OOP”, the way the average human colon is capable of “support a pool cue”. In Lua it means pissing about with metatables.
Er, okay. In Perl, it means pissing about with bless and hash references. What’s your problem with Python’s OO?
>.
Python allows breaking lines within brackets exactly so you don’t have to use backslashes.
> The indentation concept works fine when you have only one or two levels, but when you start getting to 6 and more, it actually starts to get a bit difficult to track what indentation level is where, or where you *intended* for indentation to be.
How do braces help with this at all? You still have tons of levels of indentation, but now the blocks are further apart vertically because there are a lot of lines with only a closing brace on them, and no indication what that brace actually closes.
> It also introduces a somewhat silly seeming input dependency, consider, in the case of “def” (function definition), it means you have to type two end of statement characters: the colon and the carriage return. DUH.
I conjecture the reason here is that Different Things Should Be Different. A line ending with a colon always introduces a block. Other lines are always single statements.
> (Note: suddenly Python can do “if” and “else” without colons, even handling both on one line???)
This is different syntax that happens to use the same keywords.
> # Does the if apply to “namespace + ‘::’ + name” or just to name?
> fullname = namespace+’::’+name if namespace else name
The former, because the ternary operator — as in most languages — has very low precedence.
How does it work here?
fullname = !namespace ? name : namespace + ‘::’ + name
The theme here seems to be that Python didn’t well enough reach its goal of being a clean language? But you’re lamenting that you can no longer use Perl, which doesn’t have that goal in the first place? I don’t understand.
I didn’t even go there with Perl for exactly those reasons :)
Python’s OOP? Well, start with “self”. Python’s OO is vastly better than Perl and significantly better than Lua or JavaScript, but it’s still “hey it happens it can do this!” too. At least, that’s still my impression. Even as I increasingly grow to like Python more and more.
Except in the example I cited…
An explicit statement of desire to end a level of indentation.
I conceed – in a nice editor, in either case, you have nice little guide lines showing you blocks of code, but in Python’s case that doesn’t necessarily help you tell what the author was trying to do.
Just about every human language features some form of punctuation. On the one hand, one of the things I like about Python is that little extra saving you get not having to type “;” on the end of every line when scripting.
But when I’m writing actual code, I find that I revert to putting semicolons in it. Just like I tend not to put full stops at the end of text messages, but when I’m writing on my blog, I tend to endeavor to use punctuation correctly.
Except when they are indented :) Again, another reason for having a compound statement syntax (e.g. braces, but it could just as easily be shell-like using keywords: if … fi).
(Regarding x = y if … else …)
Handled by the same tokenizer and parser, though, and with the same capabilities as regular if and else… It doesn’t follow the rule of Different Things Should Be Different or the rule of Same Things Should Be The Same.
Ternary operators are invariably evil. Python deserves kudos for having gone so long without one. But ternary operators are invariably evil, so chances are that I would be complaining whatever solution they’d adopted :)
Not sure where you picked up the idea that I’m lamenting no longer using Perl; probably from reading this post alone with no background.
Those who know me better, I hope, will read it as a semi-confessional: I saw the light as to why folks are using Python. That doesn’t change the fact that the language has it’s own particular set of flaws. But they aren’t insurmountable and they aren’t irredeemable. Most particularly, the rich set of APIs and tools that Python presents more than compensate for most of the language’s flaws (with the possible exception of the god-awful overhead of function calls).
I still use Perl, but in the spirit that Perl was developed – as a sort of hyper-awk. Anything more complex than that, scripting wise, and I fire up IDLE.
So why write a post looking for warts in Python? A sort of vocalized demon confrontation. Just like my posts on C++0X where I whoop about the upcoming features and cry about the god-awful syntax that the committees seem to be hell bent on.
I mean … in an effort to avoid a few esoteric syntax issues, they introduce the [[hiding]] and [[override]] things in virtual functions:
ARRRGH.
I still don’t understand your complaint.
selfis Python’s solution to a problem that plagues every OO system: what to do with the invocant. Perl and Python make it an explicit argument, JavaScript makes it an implicit magical context thing, C++ and Java make it outright optional. I’ve had fewest headaches with the former.
Python’s OO has first-class classes, metaclasses, transparent getters and setters, class methods, and so forth. Perhaps it’s missing interface support in core, but that doesn’t make a lot of sense to bake into a duck-typed language, and there are several third-party implementations (e.g. zope.interface). Classes are a Real Thing in Python, whereas in Perl and JavaScript and Lua they started as Hashes Plus A Class Name. What do you think is missing?
In the example you cited, you broke the line outside brackets. So, yes, you need to either keep the opening bracket on the same line or make clear your intention; a lone identifier is a valid statement by itself, albeit not a useful one. The only other approach would be for Python to guess what you mean, and down that way lies madness.
I’m having a hard time imagining how you could accidentally end a level of indentation. It’s a structural and visual change. On the other hand, closing braces are just emphasis on something you can already see at a glance — and because what you look at and what the parser looks at are different, it’s easy to write misleading code. (See, for example, the problem with braceless C blocks.) If the indentation and braces don’t match up, what does that tell me about what the author was trying to do? Did he miss a closing brace? Is this copy/paste gone awry? Is he just messing with me?
I leave periods off of text messages, too—because it’s obvious where a sentence ends when there’s one sentence per line.
Except when what are indented? Indented lines are still single statements. They might be part of a block, or they might be part of the preceding un-indented line.
A colon followed by an indented block is compound statement syntax. It just ends when the block stops being indented, rather than when there’s a squiggle to note that the end of this paragraph is in fact the end of this paragraph.
That’s actually a decent analogy: we use whitespace to delineate paragraphs (like these ones!) in English text. We have the ¶ symbol to indicate it, too, but nobody uses it because the gap is already visually obvious.
They aren’t quite the same as regular
if/
else. The inline ternary form can only contain expressions, not statements or blocks; for example, you can’t do
x = 3 if condition else x = 2. And of course, there’s no colon precisely because the colon introduces an indented block. It’s Different Enough™, and the most Englishy option.
To the best of my knowledge, it exists because people were using the grotesque hack
a and b or c, and most of them didn’t realize that it doesn’t work when
bis falsish. Adding real support is a lesser evil than encouraging programmers to continue using an opaque and broken hack.
Oh, sure. My objection, insofar as I have one, is that there are plenty of better flaws you could pick on. 8)
Lordy. I gave up on C++ a while ago, and 0x has not won my favor back. I have high hopes that Rust and/or Go will take off, or I’ll be stuck with Cython should I need to do systemsy programming.
Boy I wish this comment form would let me preview. I have no idea how screwed-up this is going to look.
Where, exactly, are you getting the impression that my post is a dismissal of python in favor of perl, javascript or lua?
I just re-read my original post in again to see where some of your seeming desire for a linguistic fisticuffs is coming from. (I.e. if you’re trolling, hats off, I can’t tell).
“self”: The need for explicit self-referentials is generally a crutch to assist what I’d call “tier 2″ OOP programming. “self” should be the default frame of reference.
The need to explicitly state “self” in an OO language introduces an uneccessary opportunity for error and a tendency to think in an un-OO way. It’s the programming equivalent of talking about yourself in the 3rd person.
if else … again, by importing a false external assumption of linguistic competitiveness, you’re continuing to read out of context. I liked Python better when it didn’t have one, but the one they hacked in disproves several long standing statements about the parser imposed structure of the language. But *shrug* I just used to write parsers for fun, so what would I know.
Mostly these are objections I felt folks I’ve spoken with previously about language choices would likely share – and my post largely counters them or explains them, at least in so far as how I surmounted my annoyance at them.
For instance, contrary to your interpretation, I don’t feel that I “hate” on the indentation approach; although I am amused at your claiming you can’t imagine someone failing to get indentation right. I can only refer you back to the context in which I describe it in the OP.
We do indeed use white space for paragraph separation, however when we have to implement multiple levels of indentation in written language we very quickly begin to introduce an assortment of punctuation or markup such as bullet points, quotes, etc.
The original context I gave was that copious use of indentation begins to become cloudy when the indentation levels are relatively small, or illegible if the indentation levels are large.
I do think that explicit block commencement and termination is better – an opinion developed through my own experimentation with whitespaced languages 26 years ago, and I believe to be borne out by it’s continual recreation across languages everywhere, from opening and closing quote marks to parentheses, to markup tags.
But I would also admit your point that you can put braces in the wrong place just as easily as you could add one tab too few or too many. However, in this case I favor the omissive approach less.
So on one level I don’t have a problem with the indentation approach, it should irk the programmer into avoiding deep nesting through the use of functions etc, but in Python the cost of a function call is quite staggering. We’re not talking about a little bit of overhead as in JavaScript, Perl, Lua or pretty much any language I can think of.
Partly because of the decorator system that Python provides to allow you to validate function arguments or inject your own customized tracing/debugging tools, and partly because of the approach they’ve used to implement named arguments … the overhead of a Python function call can literally be hundreds to thousands of times that of a similar call in another language. And it actually gets worse on newer CPUs :(
Do you have links/references to that, interesting to note (as I’d have said that if youre worried about bashing a 70 char width limit then you should be looking at breaking out into a different class/function at that point of complexity (and we’ve been moving from shell etc to python for a lot of our system stuff – and I’d like to know up front :)
Ofc we could always just use ruby *cough, hack cringe*
Yeah, from the original post:
Note: I’m talking about the relative cost of a function call, not of calling a specific function or of the execution of said function.
It’s because Python provides a variety of ways to intercept function calls, as with function decorators etc.
The trouble is that means passing thru several additional layers of non-trivial conditional logic before getting from the invocation to the actual called function itself.
If you aren’t using any decorators or any special argument passing, the overhead is acceptably low (although still many times that of calls in other languages). But when you start using named arguments and/or function decorators (such as the hidden decorators involved in the handling of member function calls), then it seriously starts to ramp up the overhead of function calls.
Its akin to the issues we used to run into back at Demon with Perl 3 where scripts would go from behaving nicely to killing boxes when it turned out that somewhere strings were being passed by value instead of carefully massaged into pass by reference; I guess. | http://kfsone.wordpress.com/2010/11/30/take-that-python/ | CC-MAIN-2014-10 | refinedweb | 4,391 | 67.69 |
Button-controlled LED
The button is a commonly used input component and widely used in a light switch, remote control, keyboard, etc, to control the current flow in the circuit. Now it’s your turn to build a LED light control using a button.
Learning goals
- Know about digital input.
- Understand how to use a button in your circuit.
- Get a rough idea of interrupt and debounce.
🔸Background
What is digital input?
The microcontroller could not only send output voltage but also receive signals. You learned about digital output in the previous tutorial, and now you will discover how digital input works.
Like digital output, digital input has two states: high and low. When an input signal comes in, its voltage will be compared with specific thresholds. If the voltage higher than the threshold, it’s high, and if it’s lower, it’s low. You can regard it as a multimeter used to measure voltage, but only has two results.
According to the input value, you could easily know the exact state of the external devices, for example, check if the button is pressed or not.
As mentioned before, the digital pins on the board act as both input and output, you need to initialize the pin as input in your code.
🔸New component
Pushbutton
Pushbutton is known as a momentary switch. In the simplified circuit below, by default, the circuit inside the button is disconnected, therefore block the current flow. As you press it, the internal metals comes into contact, so the current can flow successfully through the circuit. Once you release it, the button will go back to its original state and the current is blocked again.
Symbol:
This kind of button usually has four legs. Each two of them are shorted, like 1 and 3, 2 and 4 in the following diagram. If you connect the two legs that are shorted internally, like 1 and 3, the button is of no use since the current flows all the time.
To make things easier, it is a good idea to connect the two legs on a diagonal, like 1 and 4, 2 and 3.
Pull resistor
As you have known, the input will always be either high or low. But if the input pin is connected to nothing, what will the input value be? High or low?
That's hard to say. The state of that pin will be uncertain and change randomly between high and low states. This state is called floating. To ensure a stable state, a pull-up or pull-down resistor is needed.
Pull-up resistor
The pull-up resistor connects the input pin to power. In this case, the button should connect to the input pin and ground.
By default, when the button is not pressed, the input pin reads actually the power voltage which is high. If the button is pressed, the current flows from power directly to the ground and the pin reads low level.
Pull-down resistor
The pull-down resistor connects the input pin to ground. If so, the button should connect to the power and input pin.
By default, the pin connects directly to the ground, so the pin keeps in a low state. And if you press the button, the pin reads power voltage which is high.
In this way, the input pin is always at a determined state.
You would usually need pull-up or pull-down resistor with a button. The SwiftIO Feather board has internal pull-up and pull-down resistors. By default, the pull-down resistor is chosen. You could change it according to actual usage.
This is a simplified version for better understanding.
🔸Circuit - button module
There are two buttons on your kit. They are connected respectively to D1 and D21.
note
The circuits above are simplified for your reference.
🔸Preparation
Let’s see the new class you are going to use in this project.
Class
DigitalIn - this class allows to get current state of a specified input pin.
🔸Projects
1. LED switch
Let’s start to build a simple LED switch. When you press the button, the LED turns on. When you release the button, the LED turns off.
Example code
// Import the SwiftIO library to control input and output and the MadBoard to use the id of the pins.
import SwiftIO
import MadBoard
// Initialize the input pin for the button and output pin for the LED.
let led = DigitalOut(Id.D19)
let button = DigitalIn(Id.D1)
// Keep repeating the following steps.
while true {
// Read the input pin to check the button state.
let value = button.read()
// If the value is true which means the button is pressed, turn on the LED. Otherwise, turn off the LED.
if value == true {
led.write(true)
} else {
led.write(false)
}
}
Code analysis
let button = DigitalIn(Id.D1)
The button is an instance created for the
DigitalIn class. As usual, the id of the pin is necessary. It’s the pin the button connects: D1.
And there is an optional parameter
mode with a default value
pullDown, which means a pull-down resistor connects to the pin. There are two more options:
pullUp (pull-up resistor),
pullNone (no pull resistors).
button.read()
Use the instance method
read() to get the state from the pin. The return value tells you if it is high or low voltage. The value
true means the button is being pressed.
if value == true {
led.write(true)
} else {
led.write(false)
}
The microcontroller will judge the value read from the pin. When the value equals true, it means the button is pressed, so make the board output a high voltage to turn on the LED.
info
You might notice two similar symbols are so confusing: = and ==.
Well, = is to assign value to a constant or variable, while == compares if values are equal.
2. LED switch using interrupt
In the previous project, the microcontroller is doing nothing but checking the input value over and over again to wait button press. But what if you want to do something else in the loop? When should the microcontroller check the pin state? It’s hard to decide.
So there comes another important mechanism - interrupt for the digital input.
Interrupt
The interrupt allows the microcontroller to respond quickly to a specified event. How does it work?
- Normally the microcontroller executes its main program.
- Once the interrupt occurs, it will suspend the normal execution and then start the task with higher priority, called interrupt handler or ISR (Interrupt Service Routine).
- After finished ISR, the microcontroller goes back to where it stopped and continues the main program until another interrupt.
important
There are two points about the ISR:
- Generally, the ISR should be done as fast as possible, usually in nanoseconds.
- The functions don't need any parameters and return anything.
In short, it's better to change a value or toggle digital output for the ISR. And you should not add
print() which take about several milliseconds. Or your program may go wrong.
An interrupt may come from different sources. Now you are dealing with an interrupt triggered by the state change. There are three conditions in total:
- Rising edge: when the signal changes from low to high.
- Falling edge: when the signal changes from high to low.
- Both of them.
So when setting the interrupt, you need to tell the microcontroller the specific condition to trigger it: rising edge, falling edge, or both edges. Then once the specified edge is detected, the interrupt happens.
With interrupt mechanism, the microcontroller can
- respond instantly to what it is supposed to do, which is vital for time-critical events.
- perform other tasks while the interrupt hasn't been triggered, thus increasing the efficiency.
Example code
// Import the SwiftIO library to control input and output and the MadBoard to use the id of the pins.
import SwiftIO
import MadBoard
// Initialize the input pin for the button and output pin for the LED.
let button = DigitalIn(Id.D1)
let led = DigitalOut(Id.D19)
// Define a new function used to toggle the LED.
func toggleLed() {
led.toggle()
}
// Set the interrupt to detect the rising edge. Once detected, the LED will change its state.
button.setInterrupt(.rising, callback: toggleLed)
// Keep sleeping if the interrupt hasn't been triggered.
while true {
sleep(ms: 9999)
}
Code analysis
func toggleLed() {
led.toggle()
}
This newly declared function would be passed as parameter for the interrupt. It needs no parameter and don't have return values, which meets the requirement for the ISR.
toggle() can reverse the output from the current state to the other,from low to high, or from high to low.
Btw, changing the digital output level normally can be finished quickly, so it can be set as ISR.
button.setInterrupt(.rising, callback: toggleLed)
The interrupt will be triggered when a rising edge is detected. The rising edge here corresponds to the moment the button is pressed.
The third parameter
callback needs a specified type of functions: () -> void. It means the function has no parameters and return values.
This parameter calls the function
toggleLed defined above. Thus, once there is a rising edge, the microcontroller will come to this piece of code, then go to that function
toggleLed that
callback calls and finally know it needs to toggle the output. After finished, the microcontroller return to the previous task, in this case, sleep again.
info
Previously, you invoke them to do some work. Actually, a function can accept another function as its parameters, as long as the passed-in function follows the specified pattern.
Let's see an example!
func add1(_ num: Int) -> Int {
return num + 1
}
func multiply3(_ num: Int) -> Int {
return num * 3
}
func arithmetic(num: Int, formula: (Int) -> Int) -> Int {
return formula(num)
}
var value = 5
// 6
value = arithmetic(num: value, formula: add1)
// 18
value = arithmetic(num: value, formula: multiply3)
The function
arithmetic needs a number and a formula to compute the number. The
formula accepts an integer and returns an integer: (Int) -> Int. The other two functions
add1 and
multiply3 is in the same pattern. So
arithmetic can accept either them as a parameter, as well as other functions of this pattern. In this way, the function
arithmetic becomes general purpose and can apply different methods of computation.
while true {
sleep(ms: 9999)
}
It makes the board sleep while interrupt hasn't occurred. The sleep time can be a random value. Without it, the board will run extremely quickly again and again but do nothing.
🔸Go further
Congratulations! Now let’s dive deeper into something more complicated. Don’t be upset if you are confused. This part talks about the signal noise produced by buttons. You could skip this part and go back later as you get more familiar with all knowledge.
Debounce
When you press or release a button, you might think the button would immediately come to a stable state, closed or open. So the LED should always be on when pressing the button and turn off once the button is released. However, there may be some unexpected situations sometimes.
The button has metals inside it which will move as you press or release it. Due to this mechanical structure, there may be several bounces before the internal metals finally settle down. So once the button is pressed or released, it may change several times between two states: establish the connection and disconnect the circuit before coming to a stable state.
The signal would thus change several times during this short period. It is not visible to your eye. You could observe it by viewing the wave in the oscilloscope. But the microcontroller works much faster. It may read the values during this uncertain period and regard these noises as multiple presses.
So you need debounce methods to avoid this situation. There are many solutions, including hardware debounce and software debounce.
Hardware debounce
It lies in eliminating the influence of bounce when designing the circuit. So does the button module on this kit. Let's talk about one method used for the kit. There are also many other ways, of course.
A capacitor (C1 shown in the image below) is added to smooth the voltage changes. After the button is pressed or released, the voltage will gradually change to another level rather than accidentally change several times between the two levels.
Software debounce
It makes your board ignore the bounce and wait for the real state. Usually, you'll check many times or wait a few milliseconds to skip this unstable period. After this period, the value read from the pin should be the one needed. A fast press would at least last about 20ms. You could have a look at this reference code.
note
Since the button on the kit uses a hardware debounce method, you will not meet this problem. But it is still an important phenomenon when you DIY some projects using buttons.
🔸More info
Find out more details in the links below if you are interested: | https://docs.madmachine.io/tutorials/swiftio-circuit-playgrounds/modules/button | CC-MAIN-2022-21 | refinedweb | 2,165 | 67.04 |
GHC:0f0a1585e442089357656b87144cd22abf478dda commits 2009-06-22T14:44:43+00:00 Add a couple more symbols to the Linker.c table 2009-06-22T14:44:43+00:00 Ian Lynagh igloo@earth.li Fixes ghci loading gmp on Windows makefile tweak 2009-06-17T12:17:11+00:00 Ian Lynagh igloo@earth.li Add an _EXTRA_OBJS variable when linking packages 2009-06-16T23:17:50+00:00 Ian Lynagh igloo@earth.li Remove more GMP bits 2009-06-16T17:37:12+00:00 Ian Lynagh igloo@earth.li Add a #endif back that was accidentally removed from package.conf.in 2009-06-16T17:04:17+00:00 Ian Lynagh igloo@earth.li Make sure we aren't passing -Werror in the CFLAGS for configure scripts 2009-06-15T21:47:58+00:00 Ian Lynagh igloo@earth.li When configure tests for a feature it may not generate warning-free C code, and thus may think that the feature doesn't exist if -Werror is on. Pass CFLAGS and LDFLAGS to configure scripts 2009-06-15T20:16:04+00:00 Ian Lynagh igloo@earth.li .cmm rules need to depend on $$($1_$2_HC_DEP), not $$($1_$2_HC) 2009-06-15T13:33:57+00:00 Ian Lynagh igloo@earth.li Move gmp into libraries/integer-gmp 2009-06-14T18:31:50+00:00 Ian Lynagh igloo@earth.li Stop building the rts against gmp 2009-06-13T19:19:56+00:00 Duncan Coutts duncan@well-typed.com Nothing from gmp is used in the rts anymore. Remove the implementation of gmp primops from the rts 2009-06-13T19:18:51+00:00 Duncan Coutts duncan@well-typed.com Stop setting the gmp memory functions in the rts 2009-06-13T16:58:41+00:00 Duncan Coutts duncan@well-typed.com and remove the implementations of stg(Alloc|Realloc|Dealloc)ForGMP Remove the gmp/Integer primops from the compiler 2009-06-13T14:24:10+00:00 Duncan Coutts duncan@well-typed.com The implementations are still in the rts. Put the CMM objects in the GHCi library too 2009-06-11T16:20:38+00:00 Ian Lynagh igloo@earth.li | https://gitlab.haskell.org/trac-jberryman/ghc/-/commits/0f0a1585e442089357656b87144cd22abf478dda?format=atom | CC-MAIN-2021-39 | refinedweb | 355 | 59.9 |
The
mean’, ‘
max’,… in a single call along one of the axis. It can also execute lambda functions. Read on for examples.
We will use a dataset of FIFA players. Find the dataset here.
Basic Setup using Jupyter Notebook
Let’s start by importing pandas and loading our dataset.
import pandas as pd df_fifa_soccer_players = pd.read_csv('fifa_cleaned.csv') df_fifa_soccer_players.head()
To increase readability, we will work with a subset of the data. Let’s create the subset by selecting the columns we want to have in our subset and create a new dataframe.
df_fifa_soccer_players_subset = df_fifa_soccer_players[['nationality', 'age', 'height_cm', 'weight_kgs', 'overall_rating', 'value_euro', 'wage_euro']] df_fifa_soccer_players_subset.head()
Basic Aggregation
Pandas provides a variety of built-in aggregation functions. For example,
pandas.DataFrame.describe. When applied to a dataset, it returns a summary of statistical values.
df_fifa_soccer_players_subset.describe()
To understand aggregation and why it is helpful, let’s have a closer look at the data returned.
Example: Our dataset contains records for 17954 players. The youngest player is 17 years of age and the oldest player is 46 years old. The mean age is 25 years. We learn that the tallest player is 205 cm tall and the average player’s height is around 175 cm. With a single line of code, we can answer a variety of statistical questions about our data. The
describe function identifies numeric columns and performs the statistical aggregation for us. Describe also excluded the column
nationality that contains string values.
To aggregate is to summarize many observations into a single value that represents a certain aspect of the observed data.
Pandas provides us with a variety of pre-built aggregate functions.
Let’s use another function from the list above. We can be more specific and request the ‘
sum’ for the ‘
value_euro’ series. This column contains the market value of a player. We select the column or series ‘
value_euro’ and execute the pre-build
sum() function.
df_fifa_soccer_players_subset['value_euro'].sum() # 43880780000.0
Pandas returned us the requested value. Let’s get to know an even more powerful pandas method for aggregating data.
The ‘pandas.DataFrame.agg’ Method
Function Syntax
The
.agg() function can take in many input types. The output type is, to a large extent, determined by the input type. We can pass in many parameters to the
.agg() function.
The “
func” parameter:
- is by default set to
None
- contains one or many functions that aggregate the data
- supports pre-defined pandas aggregate functions
- supports lambda expressions
- supports the
dataframe.apply()method for specific function calls
The “
axis” parameter:
- is by default set to 0 and applies functions to each column
- if set to 1 applies functions to rows
- can hold values:
0or ‘
index’
1or ‘
columns’
What about
*args and
**kwargs:
- we use these placeholders, if we do not know in advance how many arguments we will need to pass into the function
- when arguments are of the same type, we use
*args
- When arguments are of different types, we use
**kwargs.
Agg method on a Series
Let’s see the
.agg() function in action. We request some of the pre-build aggregation functions for the ‘
wage_euro’ series. We use the function parameter and provide the aggregate functions we want to execute as a list. And let’s save the resulting series in a variable.
wage_stats = df_fifa_soccer_players_subset['wage_euro'].agg(['sum', 'min', 'mean', 'std', 'max']) print(wage_stats)
Pandas uses scientific notation for large and small floating-point numbers. To convert the output to a familiar format, we must move the floating point to the right as shown by the plus sign. The number behind the plus sign represents the amount of steps.
Let’s do this together for some values.
The sum of all wages is 175,347,000€ (1.753470e+08)
The mean of the wages is 9902.135€ (9.902135e+03)
We executed many functions on a series input source. Thus our variable ‘
wage_stats’ is of the type
Series because.
type(wage_stats) # pandas.core.series.Series
See below how to extract, for example, the ‘
min’ value from the variable and the data type returned.
wage_stats_min = wage_stats['min'] print(wage_stats_min) # 1000.0 print(type(wage_stats_min)) # numpy.float64
The data type is now a scalar.
If we execute a single function on the same data source (series), the type returned is a scalar.
wage_stats_max = df_fifa_soccer_players_subset['wage_euro'].agg('max') print(wage_stats_max) # 565000.0 print(type(wage_stats_max)) # numpy.float64
Let’s use one more example to understand the relation between the input type and the output type.
We will use the function “
nunique” which will give us the count of unique nationalities. Let’s apply the function in two code examples. We will reference the series ‘
nationality’ both times. The only difference will be the way we pass the function “
nunique” into our
agg() function.
nationality_unique_series = df_fifa_soccer_players_subset['nationality'].agg({'nationality':'nunique'}) print(nationality_unique_series) # nationality 160 # Name: nationality, dtype: int64 print(type(nationality_unique_series)) # pandas.core.series.Series
When we use a dictionary to pass in the “
nunique” function, the output type is a series.
nationality_unique_int = df_fifa_soccer_players_subset['nationality'].agg('nunique') print(nationality_unique_int) # 160 print(type(nationality_unique_int)) # int
When we pass the “
nunique” function directly into
agg() the output type is an integer.
Agg method on a DataFrame
Passing the aggregation functions as a Python list
One column represents a series. We will now select two columns as our input and so work with a dataframe.
Let’s select the columns ‘
height_cm’ and ‘
weight_kgs’.
We will execute the functions
min(),
mean() and
max(). To select a two-dimensional data (dataframe), we need to use double brackets. We will round the results to two decimal points.
Let’s store the result in a variable.
height_weight = df_fifa_soccer_players_subset[['height_cm', 'weight_kgs']].agg(['min', 'mean', 'max']).round(2) print(height_weight)
We get a data frame containing rows and columns. Let’s confirm this observation by checking the type of the ‘
height_weight’ variable.
print(type(height_weight)) # pandas.core.frame.DataFrame
We will now use our newly created dataframe named ‘
height_weight’ to use the ‘
axis’ parameter. The entire dataframe contains numeric values.
We define the functions and pass in the
axis parameter. I used the
count() and
sum() functions to show the effect of the
axis parameter. The resulting values make little sense. This is also the reason why I do not rename the headings to restore the lost column names.
height_weight.agg(['count', 'sum'], axis=1)
We aggregated along the rows. Returning the count of items and the sum of item values in each row.
Passing the aggregation functions as a python dictionary
Now let’s apply different functions to the individual sets in our dataframe. We select the sets ‘
overall_rating’ and ‘
value_euro’. We will apply the functions
std(),
sem() and
mean() to the ‘
overall_rating’ series, and the functions
min() and
max() to the ‘
value_euro’ series.
rating_value_euro_dict = df_fifa_soccer_players_subset[['overall_rating', 'value_euro']].agg({'overall_rating':['std', 'sem', 'mean'], 'value_euro':['min', 'max']}) print(rating_value_euro_dict)
The dataframe contains calculated and empty (NaN) values. Let’s quickly confirm the type of our output.
print(type(rating_value_euro_dict)) # pandas.core.frame.DataFrame
Passing the aggregation functions as a Python tuple
We will now repeat the previous example.
We will use tuples instead of a dictionary to pass in the aggregation functions. Tuple have limitations. We can only pass one aggregation function within a tuple. We also have to name each tuple.
rating_value_euro_tuple = df_fifa_soccer_players_subset[['overall_rating', 'value_euro']].agg(overall_r_std=('overall_rating', 'std'),overall_r_sem=('overall_rating', 'sem'),overall_r_mean=('overall_rating', 'mean'),value_e_min=('value_euro', 'min'),value_e_max=('value_euro', 'max')) print(rating_value_euro_tuple)
Agg method on a grouped DataFrame
Grouping by a single column
The ‘
groupby’ method creates a grouped dataframe. We will now select the columns ‘
age’ and ‘
wage_euro’ and group our dataframe using the column ‘
age’. On our grouped dataframe we will apply the
agg() function using the functions
count(),
min(),
max() and
mean().
age_group_wage_euro = df_fifa_soccer_players_subset[['age', 'wage_euro']].groupby('age').aggage(['count', 'min', 'max', 'mean']) print(age_group_wage_euro)
Every row represents an age group. The count value shows how many players fall into the age group. The min, max and mean values aggregate the data of the age-group members.
Multiindex
One additional aspect of a grouped dataframe is the resulting hierarchical index. We also call it multiindex.
We can see that the individual columns of our grouped dataframe are at different levels. Another way to view the hierarchy is to request the columns for the particular dataset.
print(age_group_wage_euro.columns)
Working with a multiindex is a topic for another blog post. To use the tools that we have discussed, let’s flatten the multiindex and reset the index. We need the following functions:
droplevel()
reset_index()
age_group_wage_euro_flat = age_group_wage_euro.droplevel(axis=1, level=0).reset_index() print(age_group_wage_euro_flat.head())
The resulting dataframe columns are now flat. We lost some information during the flattening process. Let’s rename the columns and return some of the lost context.
age_group_wage_euro_flat.columns = ['age', 'athlete_count', 'min_wage_euro', 'max_wage_euro', 'mean_wage_euro'] print(age_group_wage_euro_flat.head())
Grouping by multiple columns
Grouping by multiple columns creates even more granular subsections.
Let’s use ‘
age’ as the first grouping parameter and ‘
nationality’ as the second. We will aggregate the resulting group data using the columns ‘
overall_rating’ and ‘
height_cm’. We are by now familiar with the aggregation functions used in this example.
df_fifa_soccer_players_subset.groupby(['age', 'nationality']).agg({'overall_rating':['count', 'min', 'max', 'mean'], 'height_cm':['min', 'max', 'mean']})
Every age group contains nationality groups. The aggregated athletes data is within the nationality groups.
Custom aggregation functions
We can write and execute custom aggregation functions to answer very specific questions.
Let’s have a look at the inline lambda functions.
💡 Lambda functions are so-called anonymous functions. They are called this way because they do not have a name. Within a lambda function, we can execute multiple expressions. We will go through several examples to see lambda functions in action.
In pandas lambda functions live inside the “
DataFrame.apply()” and the “
Series.appy()” methods. We will use the
DataFrame.appy() method to execute functions along both axes. Let’s have a look at the basics first.
Function Syntax
The
DataFrame.apply() function will execute a function along defined axes of a DataFrame. The functions that we will execute in our examples will work with Series objects passed into our custom functions by the
apply() method. Depending on the axes that we will select, the Series will comprise out of a row or a column or our data frame.
The “
func” parameter:
- contains a function applied to a column or a row of the data frame
The “
axis” parameter:
- is by default set to 0 and will pass a series of column data
- if set to 1 will pass a series of the row data
- can hold values:
- 0 or ‘
index’
- 1 or ‘
columns’
The “
raw” parameter:
- is a boolean value
- is by default set to
False
- can hold values:
False-> a Series object is passed to the function
True-> a
ndarrayobject is passed to the function
The “
result_type” parameter:
- can only apply when the axis is 1 or ‘
columns’
- can hold values:
- ‘
expand’
‘reduce’
- ‘
broadcast’
The “
args()” parameter:
- additional parameters for the function as tuple
The
**kwargs parameter:
- additional parameters for the function as key-value pairs
Filters
Let’s have a look at filters. They will be very handy as we explore our data.
In this code example, we create a filter named
filt_rating. We select our dataframe and the column
overall_rating. The condition
>= 90 returns
True if the value in the
overall_rating column is 90 or above.
Otherwise, the filter returns
False.
filt_rating = df_fifa_soccer_players_subset['overall_rating'] >= 90 print(filt_rating)
The result is a Series object containing the index, and the correlated value of
True or
False.
Let’s apply the filter to our dataframe. We call the
.loc method and pass in the filter’s name as a list item. The filter works like a mask. It covers all rows that have the value
False. The remaining rows match our filter criteria of
overall_rating >= 90.
df_fifa_soccer_players_subset.loc[filt_rating]
Lambda functions
Let’s recreate the same filter using a lambda function. We will call our filter
filt_rating_lambda.
Let’s go over the code. We specify the name of our filter and call our dataframe. Pay attention to the double square brackets. We use them to pass a dataframe and not a Series object to the
.appy() method.
Inside
.apply() we use the keyword ‘
lambda’ to show that we are about to define our anonymous function. The ‘
x’ represents the Series passed into the lambda function.
The series contains the data from the
overall_rating column. After the semicolumn, we use the placeholder
x again. Now we apply a method called
ge(). It represents the same condition we used in our first filter example “
>=” (greater or equal).
We define the integer value 90 and close the brackets on our apply function. The result is a dataframe that contains an index and only one column of boolean values. To convert this dataframe to a Series we use the
squeeze() method.
filt_rating_lambda = df_fifa_soccer_players_subset[['overall_rating']].apply(lambda x:x.ge(90)).squeeze() print(filt_rating_lambda)
Let’s use our filter. Great, we get the same result as in our first filter example.
df_fifa_soccer_players_subset.loc[filt_rating_lambda]
We now want to know how many players our filter returned. Let’s first do it without a lambda function and then use a lambda function to see the same result. We are counting the lines or records.
df_fifa_soccer_players_subset.loc[filt_rating_lambda].count()
df_fifa_soccer_players_subset.apply(lambda x:x.loc[filt_rating_lambda]).count()
Great. Now let’s put us in a place where we actually need to use the
apply() method and a lambda function. We want to use our filter on a grouped data-frame.
Let’s group by nationality to see the distribution of these amazing players. The output will contain all columns. This makes the code easier to read.
df_fifa_soccer_players_subset.groupby('nationality').loc[filt_rating_lambda]
Pandas tells us in this error message that we can not use the ‘
loc’ method on a grouped dataframe object.
Let’s now see how we can solve this problem by using a lambda function. Instead of using the ‘
loc’ function on the grouped dataframe we use the
apply() function. Inside the
apply() function we define our lambda function. Now we use the ‘
loc’ method on the variable ‘
x’ and pass our filter.
df_fifa_soccer_players_subset.groupby('nationality').apply(lambda x:x.loc[filt_rating_lambda])
Axis parameter of the apply() function
Now let’s use the
axis parameter to calculate the Body-Mass-Index (BMI) for these players. Until now we have used the lambda functions on the columns of our data.
The ‘
x’ variable was a representation of the individual column. We set the axis parameter to ‘
1’. The ‘
x’ variable in our lambda function will now represent the individual rows of our data.
Before we calculate the BMI let’s create a new dataframe and define some columns. We will call our new dataframe ‘
df_bmi’.
df_bmi = df_fifa_soccer_players_subset.groupby('nationality')[['age', 'height_cm', 'weight_kgs']].apply(lambda x:x.loc[filt_rating_lambda]) print(df_bmi)
Now let’s reset the index.
df_bmi = df_bmi.reset_index() print(df_bmi)
We calculate the BMI as follows. We divide the weight in kilogram by the square of the height in meters.
Let’s have a closer look at the lambda function. We define the ‘
axis’ to be ‘
1’. The ‘
x’ variable now represents a row. We need to use specific values in each row. To define these values, we use the variable ‘
x’ and specify a column name. At the beginning of our code example, we define a new column named ‘
bmi’. And at the very end, we round the results.
df_bmi['bmi'] = df_bmi.apply(lambda x:x['weight_kgs']/((x['height_cm']/100)**2), axis=1).round() print(df_bmi)
Great! Our custom function worked. The new BMI column contains calculated values.
Conclusion
Congratulations on finishing the tutorial. I wish you many great and small insights for your future data projects. I include the Jupyter-Notebook file, so you can experiment and tweak the code. | https://blog.finxter.com/pd-agg-aggregating-data-in-pandas/ | CC-MAIN-2022-33 | refinedweb | 2,640 | 50.84 |
Install td-js-sdk on your page by copying the appropriate JavaScript snippet below and pasting it into your page's
<head> tag:
Does not work with NodeJS. Browser only.
npm install --save td-js-sdk
Exports Treasure class using CommonJS. The entry point is
lib/treasure.js. Usable with a build tool such as Browserify or Webpack.
var Treasure =
Log in to Treasure Data and go to your profile. The API key should show up right next to your full-access key.
Our library works by creating an instance per database, and sending data into tables.
First install the library using any of the ways provided above.
After installing, initializing it is as simple as:
var foo =database: 'foo'writeKey: 'your_write_only_key';
If you're an administrator, databases will automatically be created for you. Otherwise you'll need to ask an administrator to create the database and grant you
import only or
full access on it, otherwise you will be unable to send events.
// Configure an instance for your databasevar company = ...;// Create a data object with the properties you want to sendvar sale =itemId: 101saleId: 10userId: 1;// Send it to the 'sales' tablecompany;
Send as many events as you like. Each event will fire off asynchronously.
td-js-sdk provides a way to track page impressions and events, as well as client information.
Each client requires a uuid. It may be set explicitly by setting
clientId on the configuration object. Otherwise we search the cookies for a previously set uuid. If unable to find one, a uuid will be generated.
A cookie is set in order to track the client across sessions.
Tracking page impressions is as easy as:
/* insert javascript snippet */var td = ...;td;
This will send all the tracked information to the pageviews table.
In addition to tracking pageviews, you can track events. The syntax is similar to
addRecord, with the difference being that
trackEvent will include all the tracked information.
var td = {};var {td;// doButtonEvent(1);};var {td;// doButtonEvent(2);};
Every time a track functions is called, the following information is sent:
Certain values cannot be obtained from the browser. For these values, we send matching keys and values, and the server replaces the values upon receipt. For examples:
{"td_ip": "td_ip"} is sent by the browser, and the server will update it to something like
{"td_ip": "1.2.3.4"}
All server values except
td_ip are found by parsing the user-agent string. This is done server-side to ensure that it can be kept up to date.
Set default values on a table by using
Treasure#set. Set default values on all tables by passing
$global as the table name.
Using
Treasure#get you can view all global properties by passing the table name
$global.
When a record is sent, an empty record object is created and properties are applied to it in the following order:
$globalproperties are applied to
recordobject
recordobject, overwriting
$globalproperties
addRecordfunction are applied to
recordobject, overwriting table properties
Creates a new Treasure logger instance. If the database does not exist and you have permissions, it will be created for you.
Parameters:
Core parameters:
document.location.protocol
/js/v3/events
in.treasuredata.com
false
true
_td_global
Track/Storage parameters:
noneit will disable cookie storage
_td
63072000(2 years)
document.location.hostname
Returns:
Example:
var foo =database: 'foo'writeKey: 'your_write_only_key';
Sends an event to Treasure Data. If the table does not exist it will be created for you.
Records will have additional properties applied to them if
$global or table-specific attributes are configured using
Treasure#set.
Parameters:
Example:
var company = ...;var sale =itemId: 100saleId: 10userId: 1;var {// celebrate();};var {// cry();}company;
Parameters:
Example:
var td = ...var {// celebrate();};var {// cry();}td
Parameters:
Example:
var td = ...var {// celebrate();};var {// cry();};var token = 'lorem-ipsum-dolor-sit-amet'td
N.B. This feature is not enabled on accounts by defaut, please contact support for more information.
Setup an event listener to automatically log clicks.
Example:
var td = ...td
Helper function that calls trackEvent with an empty record.
Parameters:
Example:
var td = ...;td;
Creates an empty object, applies all tracked information values, and applies record values. Then it calls
addRecord with the newly created object.
Parameters:
Example:
var td = ...;td;/* Sends:{"td_ip": "192.168.0.1",...}*/td;/* Sends:{"td_ip": "0.0.0.0",...}*/
Default value setter for tables. Set default values for all tables by using
$global as the setter's table name.
Useful when you want to set a single value.
Parameters:
Example:
var td = ...td;td;/* Sends:{"foo": "bar","baz": "qux"}*/
Useful when you want to set multiple values.
Parameters:
Example:
var td = ...td;td;/* Sends:{"foo": "foo","bar": "bar","baz": "baz"}*/
Takes a table name and returns an object with its default values.
NOTE: This is only available once the library has loaded. Wrap any getter with a
Treasure#ready callback to ensure the library is loaded.
Parameters:
Example:
javascript
var td = new Treasure({..});
td.set('table', 'foo', 'bar');
td.get('table');
// {foo: 'bar'}
### Treasure#ready(fn) Takes a callback which gets called one the library and DOM have both finished loading. **Parameters:** * **fn** : Function (required) - callback function ```javascript /* javascript snippet here */ var td = new Treasure({...}) td.set('table', 'foo', 'bar'); td.ready(function(){ td.get('table'); // {foo: 'bar'} });
Need a hand with something? Shoot us an email at support@treasuredata.com
The async script snippet will create a fake Treasure object on the window and inject the async script tag with the td-js-sdk url. This fake Treasure object includes a fake of all the public methods exposed by the real version. As you call different methods, they will be buffered in memory until the real td-js-sdk has loaded. Upon td-js-sdk loading, it will look for existing clients and process their buffered actions.
The unminified script loader can be seen in src/loader.js. The code to load existing clients and their buffered actions once td-js-sdk has been loaded can be seen in lib/loadClients.js.
domreadyis kept at
0.3.0for IE6 and above support | https://www.npmjs.com/package/td-js-sdk | CC-MAIN-2017-34 | refinedweb | 1,010 | 59.4 |
HMD Specific Information¶
Exit Poll¶
The gaze buttons used by Exit Poll use the Vive HMD's forward direction to activate, NOT the eye tracking position. This will change in future releases of our SDK.
Tobii Pro VR 2.13.3¶
Setup¶
The Tobii Pro SDK Unity Package includes an example scene TobiiPro/Examples/PrefabDemo/VRPrefabDemo. This scene includes prefabs from the SteamVR Plugin Unity Package available for free on the Unity Asset Store.
These SteamVR prefabs are recommended, but not required.
Fove 0.14¶
Setup¶
To capture the player's gaze correctly, you must set the Fove Interface game object with the Camera Component to be tagged as MainCamera.
Exit Poll¶
As the Fove does not have a microphone built in, the Exit Poll microphone popup will not detect audio input unless there is a separate microphone connected and enabled.
Pupil Labs 1.4 Vive Add-on¶
Setup¶
- Install the Vive Add-On
- Download the Pupil Software and run Pupil Capture.exe
- Download and import the 0.61 Pupil Labs unity package
- Drag the pupil_plugin/Prefabs/Pupil Manager prefab into your scene
- In the prefab, set the Camera depth to 100
- Open the Cognitive Scene Setup. Select Pupil Labs SDK
The ServerIP on the PupilGazeTracker component should default as
127.0.0.1. This should be fine for testing
Play and press C to begin calibrating the Pupil Labs cameras. You may want to add a Gaze Reticle prefab from the CognitiveVR/Resources folder to display the user's current gaze position.
Leap Motion Controller 4.0.0¶
The implementation below for Leap Motion Controller does not record the full articulation of each finger, just the transform of each palm.
Leap Motion Interaction Module requires Unity 2017.2 or newer.
Setup¶
- Add a Leap Rig prefab into your scene
- Add a LoPoly Rigged Hand Left and Right parented to the Leap Rig/Hand Models gameobject
- On the Hand Models gameobject, in the Hand Model Manager component, replace the Left Model and Right Model fields with the LoPoly Rigged Hand gameobjects
- Delete the Capsule Hand gameobjects
- Add Dynamic Object components to the LoPoly Rigged Hand Left/L_Wrist/L_Palm. Make sure to select deselect Custom Mesh and choose Leap Motion Hand Left from the dropdown. Repeat this for the right hand.
Common Hand Events¶
Using the Detector components (such as FingerDirectionDetector, PalmDirectionDetector, etc) from the Leap Motion Interaction module, you can easily add Dynamic Object Engagements to a Hand Dynamic Object. Here is an example setup:
The script used in this example is:
using UnityEngine; public class EngagementEvent : MonoBehaviour { public CognitiveVR.DynamicObject TargetDynamic; public string EngagementName = "point"; public void BeginEngagement() { if (TargetDynamic != null) TargetDynamic.BeginEngagement(EngagementName); } public void EndEngagement() { if (TargetDynamic != null) TargetDynamic.EndEngagement(EngagementName); } }
Troubleshooting¶
Camera Focus¶
If the Pupil Labs cameras are not correctly focused, they may not correctly record eye position
Multiple SDKs¶
Since the Pupil Labs and Tobii Pro cameras are installed onto the HTC Vive, you can use the SteamVR SDK at the same time. When selecting your SDK, use Shift + Click to select multiple SDKs you wish to use.
If you are only using either the Pupil Labs or Tobii Pro SDK, you do not need to select Unity Default as well. | https://docs.cognitive3d.com/unity/hmd-specific-info/ | CC-MAIN-2019-13 | refinedweb | 537 | 53.81 |
19 July 2013 18:16 [Source: ICIS news]
HOUSTON (ICIS)--One ?xml:namespace>
A second producer is expected to match that nomination on Monday.
"It may not be enough," said one styrene-butadiene-rubber (SBR) producer that has been pressuring US BD producers to lower their monthly contract price in line with Europe and Asia.
It has been a steady decline for US-made BD since April. At the start of the year, the contract price for BD was 76 cents/lb among the three producers that account for about 85% of the market.
Expectations were that US BD would slowly rise through the year to above $1/lb. But then demand waned following the Lunar New Year in
BD was priced at 84 cents/lb in March and April and has fallen steadily ever since. The US BD contract price among the three key players was 79 cents/lb in May, 74 cents/lb in July and 66 cents/lb in July.
The 39% price decline from July to August is not the single-biggest monthly decline in US BD prices. In December 2008, during the worst days of the
The main reason behind the recent price drop is lacklustre demand in the replacement-tyre market, which accounts for about 80% of US BD production.
US BD and SBR producers are anxiously awaiting the second-quarter and first-half 2013 earnings conference call with Goodyear on July 30. During its first-quarter call, the
Most market participants do not expect any better news from the second-quarter conference call. In fact, most market sources have stopped looking for a turnaround in the replacement-tyre market in 2013.
Initially, some sources predicted replacement-tyre sales would pick up in the first quarter of 2013, but now sources are backing off of those predictions and saying "first half of 2013." But some sources even think that projection is optimistic, given the poor macroeconomic conditions in Europe and Asia, as well as lacklustre growth of less than 2% in the
"I've given up trying to guess when this market is going to turn around," said one pessimistic | http://www.icis.com/Articles/2013/07/19/9689393/august-us-bd-contract-nominations-coming-in-39-below-july.html | CC-MAIN-2015-18 | refinedweb | 356 | 65.76 |
Hello, I am so new with all of this. I am using "Jumping_into C++"
to start my learning of C++. I am currently stuck in Chapter 4 with this practice problem. Any input as to what I am doing wrong would be very helpful.
This is what I have so far:
Code://Program task: Ask the user for two users' ages, and //indicate who is older; //behave differently if both are over 100 #include <iostream> using namespace std; int main() { // declared variables for user input int mauricio_age; int heather_age; //Ask the user for the ages of mauricio and heather cout << "What is Mauricio age: " << "\n"; cin >> mauricio_age; cout << "What is the Hethers age: " << "\n"; cin >> heather_age; // The problem is //when I input mauricios age and it's less than 99 and heathers age is over 99 //it gives me the wrong "cout "WOW that is a lot of years"" //when it should give me "cout "Mauricio is younger than Heather". Also when I have the //same age above 99 for both mauricio and heather it gives the "cout "your age is the same" // when it should say"cout"wow that is a lot of years" if ( mauricio_age == heather_age ){cout << " Your age is the same\n";return 0;}if ( mauricio_age && heather_age >= 99 ){cout << "WOW that is alot of years\n";} else if ( mauricio_age < heather_age ) { cout << "Mauricio is younger then Heather\n"; } else { cout << "Heather is younger then Mauricio\n"; return 0; }} | http://cboard.cprogramming.com/cplusplus-programming/158096-new-cplusplus-programming.html | CC-MAIN-2015-27 | refinedweb | 240 | 66.44 |
This section is the place to post your general code offerings.
I recently heard monks complaining that applications using Term::ReadLine can't be debugged within the perldebugger b/c it's interface relies on Term::Readline.
call the script you want to debug (here calc_TRL.pl ) from a shell with
PERLDB_OPTS="TTY=`tty` ReadLine=0" xterm -e perl -d ./calc_TRL.pl
and a second xterm will be opened running the program.
a second xterm is started running the debugger, but b/c of the TTY setting in PERLDB_OPTS all debugger communication goes via the parent xterm , while the calc app normally displays in the child xterm .
ReadLine=0 tells the debugger not to rely on a working Term::ReadLine.
NB: It's important that calling the second xterm blocks the execution in the first xterm till it's finished. Like this keystrokes aren interpreted by two applications in the first xterm. Just put an & at the end to see how things get messed up otherwise if the shell tries to step in.
becomes the front end for the debugger
as you see I get the lines from the app in the second xterm listed can set a breakpoint at the end of the loop and tell twice to continue till next breakpoint.
runs the application, I'm asked to enter a calculation which is evaluated, interupted twice by a breakpoint at line 9.
Enter code: 1+2
3
Enter code: 4+4
8
[download]
> cat ./calc_TRL.pl
use Term::ReadLine;
my $term = Term::ReadLine->new('Simple Perl calc');
my $prompt = "Enter code: ";
my $OUT = $term->OUT || \*STDOUT;
while ( $_ = $term->readline($prompt) ) {
my $res = eval($_);
warn $@ if $@;
print $OUT $res, "\n" unless $@;
$term->addhistory($_) if /\S/;
}
[download]
tested with Term::ReadLine::Gnu installed.
you can use this approach whenever you want the debugger communication separated into a separate term. e.g. Curses::UI comes to mind
the solution is not "perfect", of course you need to arrange the windows and switch with Alt-Tab between them. (maybe screen could solve this or an emacs inegration)
Furthermore you won't have a history with arrow navigation within the debugger, cause TRL was disabled.
another approach is to communicate via sockets with a debugger run within emacs, since emacs has it's own TRL-emulation this shouldn't interfere.
see also Re: Testing terminal programs within emacs (SOLVED) for an approach to handle all this automatically, by restarting a script with altered environment and different terminal.
see perldebguts , perldebtut and perldeb,
Also "Pro Perl Debugging" book and various TK tools on CPAN.
Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
..with The Sound of Music. ;)
I had @SoM_notes and $SoM sitting around doing nothing, so this evening, I made them do something. In make_SoM_song and get_SoM_def, you enter a string of alphabetical notes (c, d, e, f, g, a, b). The notes can be separated by a comma, semicolon, or a space. The functions will return the note name given by Maria von Trapp in The Sound of Music.
I wrote random_SoM_note and random_SoM_song because I couldnt' help myself. Most of you know how much I love to randomly generate things. :)
make_SoM_song, get_SoM_def, and random_SoM_song all return array references.
Enjoy the code!
package SoundofMusicSong;
use strict;
use warnings;
use Exporter qw(import);
our @EXPORT_OK = qw(make_SoM_song get_SoM_def random_SoM_note random_S
+oM_song);
my @base_notes = qw(c d e f g a b);
my @SoM_notes = qw(do re me fa so la te);
my %notes;
@notes{@base_notes} = @SoM_notes;
my $SoM = {
'do' => 'a deer a female deer',
're' => 'a drop of golden sun',
'me' => 'a name I call myself',
'fa' => 'a long long way to run',
'so' => 'a needle pulling thread',
'la' => 'a note to follow so',
'te' => 'a drink with jam and bread',
};
sub make_SoM_song {
my ($user_song) = @_;
my @song_notes = split(/[ ,;]/, $user_song);
my @new_song = map { $_ = $_ =~ /^[a-g]$/ ? $notes{$_} : 'not a note
+'; $_ } @song_notes;
return \@new_song;
}
sub get_SoM_def {
my ($user_song) = @_;
my $notes = make_SoM_song($user_song);
my @new_song = map { $_ = $$SoM{$_} ? $_.' '.$$SoM{$_} : 'not a note
+'; $_ } @$notes;
return \@new_song;
}
sub random_SoM_note {
my $note = $SoM_notes[rand @SoM_notes];
return $note;
}
sub random_SoM_song {
my ($number_of_notes) = @_;
my $notes = $number_of_notes ? $number_of_notes : int(rand(100)) + 1
+;
my @new_song;
push @new_song, random_SoM_note for (1..$notes);
return \@new_song;
}
1;
[download]
USAGE: cpannn.pl [02packages.details.txt]
NAVIGATION:
. simple list of contained namespaces
.. move one level up
+ detailed list of contained namespaces
* read the readme file of current namespace
** download the current namespace's package
? print this help
TAB completion enabled on all sub namespaces
cpannn.pl by Discipulus as found at perlmonks.org
[download]
Created the following to archive data from our applications. We archive by month, and by file extension, so those are built in assumptions in this program.
Source Code:
POD:
I do a lot of work in Putty and need to look at icon files sometimes. I thought it would be cool to get Putty to display them in bash directly, rather than using X11 forwarding. This is not meant to be any kind of substitute for real graphics, but is a quick way to see whether a particular image file (like an icon or a web button) is what I think it is. Note that it requires 256 color to be turned on in Putty, that your Terminal setting is putty-256color, and it only handles image formats handled by GD (png, jpg, gif).
#!/usr/bin/perl
# Steve Flitman - released to Public Domain - display a small image on
+ the console using 256-color mode Putty/Screen
# Color output to terminal derived from Todd Larason <jtl@molehill.org
+>
use strict;
use warnings;
use GD;
unless (@ARGV) {
die "img file ...\nDisplay files at command line using ANSI 256 col
+or mode\n";
}
# set colors 16-231 to a 6x6x6 color cube
for (my $red=0; $red<6; $red++) {
for (my $green=0; $green<6; $green++) {
for (my $blue=0; $blue<6; $blue++) {
printf("\x1b]4;%d;rgb:%2.2x/%2.2x/%2.2x\x1b\\",
16 + ($red * 36) + ($green * 6) + $blue,
($red ? ($red * 40 + 55) : 0),
($green ? ($green * 40 + 55) : 0),
($blue ? ($blue * 40 + 55) : 0));
}
}
}
# colors 232-255 are a grayscale ramp, intentionally leaving out black
+ and white
for (my $gray=0; $gray<24; $gray++) {
my $level=($gray * 10) + 8;
printf("\x1b]4;%d;rgb:%2.2x/%2.2x/%2.2x\x1b\\",
232 + $gray, $level, $level, $level);
}
my ($file,$x,$y,$r,$g,$b,$color,$index,$image,$width,$height);
for $file (@ARGV) {
die "Cannot read $file: $!\n" unless -r $file;
my $image=GD::Image->new($file);
die "Not a recognized image format: $file\n" unless defined $image;
my ($width,$height)=$image->getBounds();
for (my $y=0; $y<$height; $y++) {
for (my $x=0; $x<$width; $x++) {
my $index=$image->getPixel($x,$y);
my ($r,$g,$b)=$image->rgb($index);
if ($r+$g+$b==0) { # black
$color=0;
}
elsif ($r==255 && $g==255 && $b==255) { # white
$color=15;
}
elsif ($r==$g && $g==$b) { # grayscale
$color=232+($r>>3);
} else {
$color=16+(int($r/42.6)*36)+(int($g/42.6)*6)+int($b/42.6);
+ # smush 256 color range to 6 levels
}
print "\x1b[48;5;${color}m ";
}
print "\x1b[0m\n"; # reset
}
print "\x1b[0m\n"; # reset
}
exit;
[download]
Dedicated to the memory of John Todd Larason,
Enjoy!
SSF.
(Source:)
It may stretch the definition of "cool" and may be old news but maybe a few monks will find this amusing...
$/ = ""; #set to paragraph mode
while(<$file>){
if ($_ =~ /$first_match/ && $_ =~ /$second_match/ && $_ =~ /$third
+_match/){
print "$_\n";
my ($needed_data_0) = (/^data_here(.+)/, $_);
my ($needed_data_1) = (/^more_data(.+)/, $_);
my ($needed_data_2) = (/^other_data(.+)/, $_);
print "data0 is: $needed_data_0\n";
print "data1 is: $needed_data_1\n";
print "data2 is: $needed_data_2";
}
}
[download]
use strict;
use warnings;
use diagnostics;
use File::Random qw(random_file);
my $dir = $ARGV[0];
if ( not defined $dir ) {
print "\nUsage: random.pl [folder];
exit(0);
}else{
random($dir);
}
sub random{
my ($dir) = @_;
while (1){
my $mpc = "C:/Program Files (x86)/K-Lite Codec Pack/Media
+Player Classic/mpc-hc.exe";
my $rndm_file = random_file(
-dir => $dir,
#-check => qr/./,
-recursive => 1
);
if ($rndm_file =~ /\.(ini|nfo|db)$/i){
print "$rndm_file\n";
random($dir);
}
print $rndm_file;
#get duration
my $t = ("MediaInfo.exe --Output=Video;%Duration% \"F:/TV/
+$rndm_file\"");
system(1, $mpc, "F:/TV/$rndm_file");
my $time = qx($t);
my $sleep_time = $time/1000; #in seconds because m
+ediainfo.exe outputs milliseconds i think.
print "\nDuration in seconds: $sleep_time\n";
sleep($sleep_time);
random($dir);
}
}
[download]
Yesterday I wanted to compare two hashes to see if they were the same. I looked around a little bit and found Data::Compare. It was good at telling me the two hashes were different, however, it did not tell me where. So, I wrote a small little subroutine to recursively check my hash of hashes (of hashes). It was able to identity where I had to look to make corrections, almost to the exact spot. (I am unsure how to compare arrays of hashes just yet which is why the following little subroutine will almost take you to the right spot.)
There are still holes in the script, but it worked for me today.
#!/usr/bin/perl
use strict;
use warnings FATAL => qw( all );
use Data::Compare;
use Data::Dumper;
# You can take out all instances of the subroutine 'line' to print wha
+t you want in those places.
sub deep_data_compare {
my ($tab, $old_data, $new_data, $data) = @_;
my $old = $old_data;
my $new = $new_data;
my $compare = new Data::Compare($old, $new);
if ($compare->Cmp == 0) {
line($tab,$data) if $data;
if (ref($old) eq 'HASH' && ref($new) eq 'HASH') {
line($tab+1,'old to new');
for (keys %$old) {
deep_data_compare($tab+2,$_,$$old{$_},$$new{$_});
}
}
# I have not figured out this part yet.
# elsif (ref($old) eq 'ARRAY' && ref($new) eq 'ARRAY') {
# }
else {
print Dumper($new);
print Dumper($old);
}
}
}
sub rline {
my ($tab,$line) = @_;
return qq(\t) x $tab.qq($line\n);
}
sub line {
print rline(@_);
}
deep_data_compare(0, \%old_hash, \%new_hash, 'widgets');
[download]
Dear monks and nuns, priests and scribes, popes and antipopes, saints and stowaways lurking in the monastery, lend me your ears. (I promise I'll return them.) I'm still hardly an experienced Perl (user|programmer|hacker), but allow me to regale you with a story of how Perl has been helping me Get Things Done™; a Cool Use for Perl, or so I think.
I was recently faced with the problem of producing, given a number of lines each written in a specific script (i.e. writing system; Latin, Katakana, Cyrillic etc.), a breakdown of scripts used and how often they appeared. Exactly the sort of problem Perl was made for - and thanks to regular expressions and Unicode character classes, a breeze, right?
I started by hardcoding a number of scripts to match my snippets of text against:
my %scripts;
foreach (@lines) {
my $script =
m/^\p{Script=Latin}*$/ ? "Latin" :
m/^\p{Script=Cyrillic}*$/ ? "Cyrillic" :
m/^\p{Script=Han}*$/ ? "Han" :
# ...
"(unknown)";
$scripts{$script}++;
}
[download]
Obviously there's a lot of repetition going on there, and though I had a list of scripts for my sample data, I wasn't sure new and uncontemplated scripts wouldn't show up in the future. So why not make a list of all possible scripts, and replace the hard-coded list with a loop?
my %scripts;
LINE: foreach my $line (@lines) {
foreach my $script (@known_scripts) {
next unless $line =~ m/^\p{Script=$script}*$/;
$scripts{$script}++;
next LINE;
}
$scripts{'(unknown)'}++;
}
[download]
So far, so good, but now I needed a list of the scripts that Perl knew about. Not a problem, I thought, I'll just check perluniprops; the list of properties Perl knows about was staggering, but I eventually decided that any property of the form "\p{Script: ...}" would qualify, so long as it had short forms listed (which I took as an indication that that particular property was the "canonical" form for the script in question). After some reading and typing and double-checking, I ended up with a fairly long list:
my @known_scripts = (
"Arabic", "Armenian", "Avestan",
"Balinese", "Bamum", "Batak", "Bengali", "Bopomofo", "Brahmi", "Br
+aille",
"Buginese", "Buhid",
"Canadian_Aboriginal", "Carian", "Chakma", "Cham", "Cherokee",
"Coptic", "Cuneiform", "Cypriot", "Cyrillic",
# ...
);
[download]
Unfortunately, when I ran the resulting script, Perl complained:
Can't find Unicode property definition "Script=Chakma" at (...) line (
+...)
[download]
What had gone wrong? Versions, that's what: I'd looked at the perluniprops page on perl.org, documenting Perl 5.20.0, but this particular Perl was 5.14.2 and didn't know all the scripts that the newer version did, thanks to being built against an older Unicode version. Now, I could've just looked at the locally-installed version of the same perldoc page, but - wouldn't it be nice if the script automatically adapted itself to the Perl version it ran on? I sure reckoned it'd be.
What scripts DID the various Perl versions recognize, anyway? What I ended up doing (perhaps there's an easier way) was to look at lib/unicore/Scripts.txt for versions 5.8, 5.10, ..., 5.20 in the Perl git repo (I skipped 5.6 and earlier, because a) the relevant file didn't exist in the tree yet back then, and b) those versions are ancient, anyway). And by "look at", I mean download (as scripts-58.txt etc.), and then process:
$ for i in 8 10 12 14 16 18 20; do perl scripts.pl scripts-5$i.txt >5$
+i.lst; done
$ for i in 8 10 12 14 16 18; do diff --unchanged-line-format= --new-li
+ne-format=%L 5$i.lst 5$((i+2)).lst >5$((i+2)).new; done
$
[download]
scripts.pl was a little helper script to extract script information (apologies for the confusing terminology, BTW):
#!/usr/bin/perl
use strict;
use warnings;
use feature qw/say/;
my %scripts;
while(<>) {
next unless m/; ([A-Za-z_]*) #/;
$scripts{$1}++;
}
$, = "\n";
say sort { $a cmp $b } map { $_ = ucfirst lc; $_ =~ s/(?<=_)(.)/uc $1/
+ge; qq/"$_"/ } keys %scripts;
[download]
I admit, I got lazy at this point and manually combined those files (58.lst, as well as 510.new, 512.new etc.) into a hash holding all the information, instead of having a script output it. Nonetheless, once this was done, I could easily load all the right scripts for a given Perl version:
# New Unicode scripts added in Perl 5.xx
my %uniscripts = (
'8' => [
"Arabic", "Armenian", "Bengali", "Bopomofo", "Buhid",
"Canadian_Aboriginal", "Cherokee", "Cyrillic", "Deseret",
"Devanagari", "Ethiopic", "Georgian", "Gothic", "Greek", "Guja
+rati",
"Gurmukhi", "Han", "Hangul", "Hanunoo", "Hebrew", "Hiragana",
"Inherited", "Kannada", "Katakana", "Khmer", "Lao", "Latin",
"Malayalam", "Mongolian", "Myanmar", "Ogham", "Old_Italic", "O
+riya",
"Runic", "Sinhala", "Syriac", "Tagalog", "Tagbanwa", "Tamil",
"Telugu", "Thaana", "Thai", "Tibetan", "Yi"
],
'10' => [
"Balinese", "Braille", "Buginese", "Common", "Coptic", "Cuneif
+orm",
"Cypriot", "Glagolitic", "Kharoshthi", "Limbu", "Linear_B",
"New_Tai_Lue", "Nko", "Old_Persian", "Osmanya", "Phags_Pa",
"Phoenician", "Shavian", "Syloti_Nagri", "Tai_Le", "Tifinagh",
"Ugaritic"
],
'12' => [
"Avestan", "Bamum", "Carian", "Cham", "Egyptian_Hieroglyphs",
"Imperial_Aramaic", "Inscriptional_Pahlavi",
"Inscriptional_Parthian", "Javanese", "Kaithi", "Kayah_Li",
"Lepcha", "Lisu", "Lycian", "Lydian", "Meetei_Mayek", "Ol_Chik
+i",
"Old_South_Arabian", "Old_Turkic", "Rejang", "Samaritan",
"Saurashtra", "Sundanese", "Tai_Tham", "Tai_Viet", "Vai"
],
'14' => [
"Batak", "Brahmi", "Mandaic"
],
'16' => [
"Chakma", "Meroitic_Cursive", "Meroitic_Hieroglyphs", "Miao",
"Sharada", "Sora_Sompeng", "Takri"
],
'18' => [
],
'20' => [
],
);
(my $ver = $^V) =~ s/^v5\.(\d+)\.\d+$/$1/;
my @known_scripts;
foreach (keys %uniscripts) {
next if $ver < $_;
push @known_scripts, @{ $uniscripts{$_} };
}
print STDERR "Running on Perl $^V, ", scalar @known_scripts, " scripts
+ known.\n";
[download]
The number of scripts Perl supports this way WILL increase again soon, BTW. Perl 5.21.1 bumped the supported Unicode version to 7.0.0, adding another bunch of new scripts as a result:
# tentative!
'22' => [
"Bassa_Vah", "Caucasian_Albanian", "Duployan", "Elbasan", "Gra
+ntha",
"Khojki", "Khudawadi", "Linear_A", "Mahajani", "Manichaean",
"Mende_Kikakui", "Modi", "Mro", "Nabataean", "Old_North_Arabia
+n",
"Old_Permic", "Pahawh_Hmong", "Palmyrene", "Pau_Cin_Hau",
"Psalter_Pahlavi", "Siddham", "Tirhuta", "Warang_Citi"
],
[download]
But that's still in the future. For now I just tested this on 5.14.2 and 5.20.0 (the two Perls I regularly use); it worked like a charm. All that was left to do was outputting those statistics:
print "Found " . scalar keys(%scripts) . " scripts:\n";
print "\t$_: " , $scripts{$_}, " line(s)\n" foreach(sort { $a cmp $b }
+ keys %scripts);
[download]
(You'll note that in the above two snippets, I'm using print rather than say, BTW. That's intentional: say is only available from Perl 5.10 on, and this script is supposed to be able to run on 5.8 and above.)
Fed some sample data that I'm sure Perlmonks would mangle badly if I tried to post it, this produced the following output:
Running on Perl v5.14.2, 95 scripts known.
Found 18 scripts:
Arabic: 21 line(s)
Bengali: 2 line(s)
Cyrillic: 12 line(s)
Devanagari: 3 line(s)
Georgian: 1 line(s)
Greek: 1 line(s)
Gujarati: 1 line(s)
Gurmukhi: 1 line(s)
Han: 29 line(s)
Hangul: 3 line(s)
Hebrew: 1 line(s)
Hiragana: 1 line(s)
Katakana: 1 line(s)
Latin: 647 line(s)
Sinhala: 1 line(s)
Tamil: 4 line(s)
Telugu: 1 line(s)
Thai: 1 line(s)
[download]
Problem solved! And not only that, it's futureproof now as well, adapting to additional scripts in my input data, and easily extended when new Perl versions support more scripts, while maintaining backward compatibility.
What could still be done? Several things. First, I should perhaps find out if there's an easy way to get this information from Perl, without actually doing all the above.
Second, while Perl 5.6 and earlier aren't supported right now, they could be. Conveniently, the 3rd edition of Programming Perl documents Perl 5.6; the \p{Script=...} syntax for character classes doesn't exist yet, I think, but one could write \p{In...} instead, e.g. \p{InArabic}, \p{InTamil} and so on. Would this be worth it? Not for me, but the possibility is there if someone else ever had the need to run this on an ancient Perl. (Even more ancient Perls may not have the required level of Unicode support for this, though I wouldn't know for sure.)
Lastly, since the point of this whole exercise was to identify writing systems used for snippets of text, there's room for optimization. Perhaps it would be faster to precompile a regular expression for each script, especially if @lines is very large. Most of the text I'm dealing with is in the Latin script; as such, I should perhaps test for that before anything else, and generally try to prioritize so that lesser-used scripts are pushed further down the list. Since I'm already keeping a running total of how often each script has been seen, this could even be done adaptively, though whether doing so would be worth the overhead in practice is another question, one that could only be answered by measuring.
But neither speed nor support for ancient Perls is crucial to me, so I'm done. This was a fun little problem to work on, and I hope you enjoyed reading about it.
I like Mojolicious, but it was hard to
learn. More than six months later I still feel I'm just scratching the surface.
So, what I'm about to offer may not be great, but it is as far as I've come.
You'll still need to study the Mojolicious documentation, but you can start
with this rather than nothing.
And a tip of the hat to Sebastian and his team mates, who have answered my
novice questions and have been quick to improve the documentation to help
newbies like me.
Neil Watson
watson-wilson.ca
I wrote a Perl library, and I think it's pretty cool, but I'm also asking your opinions about it - is it worth putting on CPAN, for instance.
It is a pure-Perl library for handing Commodore disk images. For those needing a refresher, these are digital images of diskettes and hard disks used by Commodore computers in the late 1970s thru the 1980s.
It's hosted inside my network, behind my modem's firewall, by my Raspberry Pi running a cheapo web server I wrote (also in Perl) specifically for the purpose of serving and manipulating Commodore disk images.
My library handles D64, D71, D81, D67, D80, D82, and X64 image types. Each format is a little package (about 8k) with data specific to that image. I made them packages, although I could have just used parametric data. These packages are essentially parametric data anyhow, and provide context to a generic engine that knows how Commodore disk images work.
The library is 140k (includes good POD documentation, which is rare for me) split among about 20 files.
First, is it worth posting to CPAN. It's awfully specialized. Maybe it would be better just to post it as a tarball on a website (or github?).
Second, it's been nearly 10 years since I've uploaded to CPAN, and I am intimidated by the process. Yes, I've read the rules, but I'm concerned about uploading 20 related files in one batch. Anyone have any advice beyond what PAUSE has to say?
Thanks for listening.
There is a free web hosting which offers a third-level domain name and an installation of their proprietary CMS. It is somewhat widely known in the ex-USSR countries. They have "Web 2.0" AJAX interface, a lot of modules for nearly everything, from a simple forum to a web shop, and a primitive read-only API. I happen to be moderating one of such forums. Despite not being popular in terms of human population it has recently gained a lot of popularity among spam-sending robots.
At first they all were making the same mistake of posting messages with titles equal to their nicknames, and so the first version of bothunter.pl was born. It employed link parsing routines of WWW::Mechanize and reproduced a sniffed AJAX request by some black magic of parsing JavaScript source for variables. Needless to say, soon it broke, both because JavaScript source slightly changed and because bots became slightly smarter, so the moderators went back to deleting bots manually.
Yesterday I thought: with PhantomJS, I could mimic the browser and click all these AJAX buttons required to ban a user. As for the spam, maybe it's possible to count unique words in a message and warn if some of them is repeated a lot, and a list of stop-words could help, too... Before I started thinking of ways to automatically build a list of stop words from spam messages I realised that I was reiventing the wheel and searched for spam detection engines.
My first try was Mail::SpamAssassin, because it's written in Perl and I heard a lot of stories about plugging it into other programs. It turned out to be not so easy to make it work with plain text (non-mail) messages, so I searched for alternatives. It is Mail::SpamAssassin, after all. Bogofilter is not written in Perl, but still was easy to plug in my program, thanks to its -T option, and it happily works with plain text without complaining.
Interfacing with the site was not so easy. Banning a spam robot (click-click-tab-tab-"spam robot"-tab-space-tab-space) exploded into a mess of ->clicking xpath-found elements; at one time the site refused to register my click no matter how I tried, so I had to call the corresponding JS function manually; in the other place of program I find myself logged out, and the only way to get back in is to load the page I'm going to delete, load the login page, log in, then load the to-be-deleted page again. Kludges. Ew.
So, here it is: the second version of bot hunter Perl program. I hope it won't break as fast as the first one. Or, at least, will be easier to fix.
(FYI: the Raspberry Pi can run a number of Linux systems, all with Perl. I wrote a tiny HTTP server on it which lets me create and serve Commodore disk images, also allowing me to extract and inject files, in Perl of course. It runs behind my firewall...)
'bld' is entirely in Perl.
'bld' is a replacement for the 'make' command. It is based on determi
+ning out of dateness by
signatures(SHA1) not dates. For a critique of 'make' and why you woul
+d want to do this
see: and the FEATURES AND AD
+VANTAGES section below
(item 13) "'make' and it's difficulties". 'bld' at present has been d
+esigned and tested for
C/C++/Objective C/Objective C++/ASM; Java or any other languages are n
+ot at present used.
Installing 'bld' is very simple. Download bld-1.0.0.tar.xz from https
+://github.com/rahogaboom/bld.
Unpack wherever in your home directory and install the experimental.pm
+ Perl module.
Make sure you have access to GNU 'cpp' and 'ldd'. To run the examples
+(examples, git, svn, systemd)
you'll need gcc(1)/g++(1) () and clang(1) (
+lvm.org/). That's It!
I used the git, svn and systemd projects as complex multi-target examp
+les of how bld would be used
to re-'make' these projects. They are well known and widely used. An
+y other projects might do.
Read the bld.README file.
Do './bld -h'.
Do 'perldoc bld'.
Do './bld' to build the exec-c executable "Hello, world!" program. Th
+is creates the
bld.info, bld.warn and Bld.sig files which along with the Bld file
+ gives an
illustration of how to construct Bld files and the output that bld
+ creates.
I plan on adding an App::bld distribution to CPAN.
NAME
bld
VERSION
bld version 1.0.0
USAGE
usage: bld [-h]
-h - this message.(exit)
ARGUMENTS
None
OPTIONS
bld [-h]
-h
help message(exit)
ENVIRONMENT VARIABLES
None
RC CONFIGURATION FILES
None
DEPENDENCIES
Required for execution:
experimental.pm(3pm) - for smartmatch and switch features
cpp(1) - gnu cpp cmd is required for dependency determination
ldd(1) - used for library dependency determination
Required for test:
gcc(1)/g++(1) ()
clang(1) ()
FEATURES AND ADVANTAGES
1. Everything is done with SHA1 signatures. No dates are used anywhe
+re. Signatures are a property of the
file and not meta data from the system used for the build. Any ti
+me issues, whether related to local
clocks, networked host clocks or files touched by command activiti
+es are eliminated. Modern signature
algorithms are strongly randomized even for small file changes - f
+or the 160 bit SHA1 hash collisions are
unlikely in the extreme. The Digest::SHA module is fast. The exp
+ense of signature calculation times
is small relative to the expense of programmer time. An investiga
+tion of some other make alternatives
e.g. scons, cook - will disclose that they too are using signature
+s - maybe for exactly for the same reasons.
2. bld is REALLY simple to use. There are no arguments, no options(e
+xcept -h), no environment variables and
no rc files. The entire bld is controlled from the Bld(and Bld.gv
+ file) file. Only a minimal knowledge
of perl is needed - variable definitions and simple regular expres
+sions.
3. Automatic dependency checking - GNU cpp is used to find the header
+ file dependencies. Optionally, header
file checking may be done for user header files only or for simult
+aneously both system header and user
header files. All header file dependency information associated w
+ith each source is saved to the
bld.info file.
4. There are no built in dependency rules. The Bld file DIRS section
+ specifications give what is to be
built from what and the Bld file EVAL section gives how to assembl
+e all the components for the target.
5. bld is not hierarchical. A single Bld file controls the construct
+ion of a single target(a target is an
executable or library(static or shared)). Complex multi-target pr
+ojects use one Bld.gv(global values)
file and many Bld files - one to a target. The source directory s
+tructure goes under bld.<project>/<version>
and each target Bld file(Bld.<project>.<target>) encapsulates all
+the build information for all the
source directories under bld.<project>/<version>. All the built t
+argets and build information files go
into the Bld.<project>/<version> directory. See 13 below for reas
+ons why recursive make causes problems.
6. Each source file will have three signatures associated with it - o
+ne for the source file, one for the
corresponding object file and one for the cmds use to rebuild the
+source. A change in any of these will
result in a rebuild. A change in the target signature will result
+ in a rebuild. Optionally, the
signatures of dynamic libraries may be tracked. If a library sign
+ature changes the bld may warn or stop
the rebuild. If dynamic libraries are added or deleted from the b
+ld this can ignore/warn/fatal.
7. If any files in the bld have the same signature this is warned abo
+ut e.g. two header or source files of
the same or different names.
8. Complex multi-target projects are built with a standard directory
+setup and a standard set of scripts -
Directories:
Bld.<project>/<version> - has all files controlling <pro
+ject> <version>s blds and bld target output files
bld.<project>/<version> - source code for <project> <ver
+sion>s
Files:
bld.<project> - for initiating single target,
+multi-target or all target blds of a <project>
bld.<project>.rm - for initiating single target,
+multi-target or all target clean of a <project>
bld.<project>.targets - list of all <project> targets
bld.<project>.README - <project> README
bld.<project>.install - <project> install script
bld.<project>.script.<script> - scripts called by the Bld.<pro
+ject>.<target> files
Bld.<project>.<target> - the Bld file for each <project
+> <target>
Bld.gv.<project> - global values imported into al
+l Bld.<project>.<target> files
9. Security - since the signatures of everything(source, objects, lib
+raries, executable) are checked it is
more difficult to insinuate an exploit into a source, object, libr
+ary or executable during the build process.
10. The capture of the full build process in the bld.info, bld.warn a
+nd bld.fatal files allows easy access to
and saving of this information. For multi-target projects with t
+he target names appended to these files
it allows quick investigation of the build process of many interr
+elated targets at the same time.
11. Perl - since bld is all perl and since all warnings and fatals ha
+ve the source line number associated with
them, it is very easy to locate in the souce code the exact locat
+ion of an error and examine the context
about which the error occurred and routine that the error was pro
+duced in.
12. Time - programmer time; learning about, maintaining/debugging Mak
+efiles and Makefile hierarchies, dependency
checking integration and formulation of Makefile strategies, auto
+matic Makefile generation with Autotools -
these all dominate the programmer time and expense of 'make'. bl
+d only requires basic perl variables(in
the Bld file EVAL section) and '[R] dir:regex:{cmds}' line specif
+ications(in the Bld file DIRS section).
13. 'make' and it's difficulties:
a detailed critique of make and some alternatives
a description of the scons architecture and in particular
+ the reasons for the use of signatures instead of dates
+.html#SEC3
a brief critique of make and how GNU automake from the GN
+U Build System contributes
an article "Recursive Make Considered Harmful" by Peter M
+iller from the Australian UNIX Users Group
an in depth critique of make
PROJECT STATE
State:
1. The code is mostly done - unless someone finds a bug or suggests a
+n enhancement.
2. The in code documentation is done.
3. The testing is 80%-90% done.
4. The usage msg is done - the perldoc is 50%-60% done, needs a lot o
+f work.
Needed:
1. The code is in very good shape unless someone discovers a bug or s
+uggests an enhancement.
My current focus is on the documentation and testing.
2. The git, svn and systemd projects need work. I ran ./configure be
+fore each bld. I used
no options. How options affect the generated code and thus the Bl
+d files is important.
Anyone willing to investigate configure options and how these opti
+ons affect the Bld files
is welcome.
3. The bld.<project>.install scripts all need to be done. I'd prefer
+ to partner with someone
knowledgeable about the installation of git, svn and systemd.
4. All the Bld.gv.<project> files should be vetted by a <project> kno
+wledgeable builder.
5. The git, svn and systemd projects will all be creating new version
+s eventually. Anyone
that would like to add bld.<project>/<version> and Bld.<project>/<
+version> directories
with the new versions is welcome.
6. I need someone with substantial experience building the linux kern
+el to advise me or partner
with me on the construction of 3.15 or later.
7. If you successfully bld a new project and wish to contribute the b
+ld, please do so. I'm
interested in how others construct/organize/document/debug project
+s and their Bld files.
DESCRIPTION
bld(1.0.0) is a simple flexible non-hierarchical program that builds
+a single C/C++/Objective C
/Objective C++/Assembler target(executable or library(static or share
+d)) and, unlike 'make', uses SHA1
signatures(no dates) for building software and GNU cpp for automatic
+header file dependency
checking. The operation of bld depends entirely on the construction
+of the Bld(bld specification)
and Bld.gv(bld global values) files. See the bld.README file. There
+ are no cmd line arguments or
options(except for -h(this msg)) or $HOME/.bldrc or ./.bldrc files an
+d no environment variables are
used. Complex multi-target projects are bld't with the use of a Bld.
+<project> (Bld files and
target bld output files) directory, bld.<project>(project source) dir
+ectory, bld.<project>(target
construction) script, bld.<project>.rm(target and bld.<info|warn|fata
+l>.<target> file removal)
script, Bld.<project>.gv(project global values) file, bld.<project>.i
+nstall(target and file
install) script and bld.<project>.README(project specific documentati
+on) file. Current example
projects:
Bld.git - the git project
Bld.svn - the subversion project
Bld.systemd - the systemd project
+/Software/systemd/
Bld.example - misc examples intended to show how to create Bld an
+d Bld.gv files
bld is based upon taking the SHA1 signature of anything that, when ch
+anged, would require a
rebuild of the executable/library. It is not, like 'make', based in
+any way on dates. This
means that source or header files may be moved about, and if the file
+s do not change then
nothing needs to, or will, be rebuilt. bld is not hierarchical; all
+of the information to
rebuild the executable is contained in the Bld(and Bld.gv) file. The
+ rebuild is based on Perl's
regex engine to specify source file patterns along with the Perl eval
+{} capability to bring
variable definitions from the Bld file into the source.
bld reads the Bld file which describes the build. This example Bld f
+ile serves for the
following discussion:
Program description and Bld file explanatory comments go here.(and
+ are ignored by bld)
EVAL
DIRS
The Bld file has three sections , a starting comment section to docum
+ent the Bld, an EVAL and DIRS.
Variables to be used for interpolation into build commands are define
+d in the EVAL section.
The variables are all Perl variables. The entire EVAL section is eva
+l{}'ed in bld. Any
errors will terminate the run. The DIRS section has three field(: 0)
+ lines which are
the directory, the matched files to a Perl regular expression, and a
+build command for the line
matched files. EVAL section variable definitions are interpolated in
+to the build commands.
bld will execute "$cmd $dir/$s"; for each source file, with $cmd from
+ the interpolated third
field, $dir from the first field, and $s from the matched source seco
+nd field of the DIRS
section lines. Rebuilds will happen only if:
1. a source file is new or has changed
2. the corresponding object file is missing or has changed
3. the command that is used to compile the source has changed
4. a dependent header file has changed
5. the command to link the executable or build the library archive
+ has changed
6. the executable or library has changed or is missing
The Bld.sig file, automatically built, holds the source/object/header
+/executable/library file
names and the corresponding signatures used to determine if a source
+should be rebuilt the
next time bld is run. Normally, system header files are included in
+the rebuild criteria.
However, with the -s switch, signature testing of these files can be
+disabled to improve
performance. It is unusual for system header files to change except
+after a new OS
installation.
add description of directory structure - o dir - build dir
QUICK START
1. Bld'ing the systemd project -
+ware/systemd/
a. cd Bld.systemd/systemd-208 # puts you into the systemd(systemd-
+208) project directory
b. ./bld.systemd --all # bld's all of the systemd targets a
+nd bld target output files -
the bld.info.systemd.<target>,
the bld.warn.systemd.<target>,
the bld.fatal.systemd.<target>
+,
files
c. ./bld.systemd.rm --all # cleans up everything
2. Bld'ing the svn project -
a. cd Bld.svn/subversion-1.8.5 # puts you into the svn(subversion-
+1.8.5) project directory
b. ./bld.svn --all # bld's all of the svn targets and
+bld target output files -
the bld.info.svn.<target>,
the bld.warn.svn.<target>,
the bld.fatal.svn.<target>,
files
c. ./bld.svn.rm --all # cleans up everything
3. Bld'ing the git project -
a. cd Bld.git/git-1.9.rc0 # puts you into the git(git-1.9.rc0) pro
+ject directory
b. ./bld.git --all # bld's all of the git targets and bld t
+arget output files -
the bld.info.git.<target>,
the bld.warn.git.<target>,
the bld.fatal.git.<target>,
files
c. ./bld.git.rm --all # cleans up everything
4. Bld'ing any single target
a. cd bld # the main bld directory - cd here when you unpack
+ the bld.tar.xz file
b. Install the source code in a sub-directory of the bld directory
c. Create a Bld file - the Bld file entirely controls the target b
+ld - see example below
d. ./bld -h # the bld usage msg
e. ./bld # do the bld
f. ./bld.rm # clean up
g. vi Bld.sig # examine the bld signature file
h. vi bld.info # detailed info about the stages of the bld
i. vi bld.warn # warning msgs from the bld
j. vi bld.fatal # fatal msgs that terminated the bld - should be e
+mpty if bld is successful
FILES
~/bld directory files:
bld - the bld perl script
bld.rm - script to clean the bld directory
bld.README - for first point of contact quick start
Bld - the bld file which controls bld and the construction of
+a target
Bld.gv - the file of global values imported into the Bld file(unu
+sually used only for multi-target builds)
Bld.sig - the signature(SHA1) file created from the Bld file
bld.info - information about the bld
bld.warn - warnings from the bld
bld.fatal - the fatal msg that ended the bld
~/bld directories:
Bld.<project>/<version> - has all files controlling <project> <versio
+n>s blds and bld target output files
bld.<project>/<version> - source code for <project> <version>s
aux - template scripts for <project> blds
~/bld/aux files:
aux/bld.<project> - template copied to Bld.<project>/<version>
+directories to bld multi-target projects
aux/bld.<project>.rm - template copied to Bld.<project>/<version>
+directories to clean multi-target projects
~/bld/Bld.<project>/<version> files:
bld.<project> - for initiating single target, multi-t
+arget or all target blds of a <project>
bld.<project>.rm - for initiating single target, multi-t
+arget or all target clean of a <project>
bld.<project>.targets - list of all <project> targets
bld.<project>.README - <project> README
bld.<project>.install - <project> install script
bld.<project>.script.<script> - scripts called by the Bld.<project>.<
+target> files
Bld.<project>.<target> - the Bld file for each <project> <targ
+et>
Bld.gv.<project> - global values imported into all Bld.<
+project>.<target> files
Bld.sig.<project>.<target> - the signature(SHA1) file for each <pr
+oject> <target>
bld.info.<project>.<target> - the bld.info file for each <project>
+<target>
bld.warn.<project>.<target> - the bld.warn file for each <project>
+<target>
bld.fatal.<project>.<target> - the bld.fatal file for each <project>
+ <target>
bld.<project>.targets - all of the <project> targets
PRIMARY PROGRAM DATA STRUCTURES
TBD
NOTES
1. bld assumes that a source will build a derived file e.g. .o files
+in the same directory and
have the same root name as the source.
2. bld assumes that all targets in multi-target bld's will be uniquel
+y named - all targets go
into the same project directory.
3. Some projects violate either or both of these target naming or obj
+ect file naming/location
requirements, but reconstructing these projects with bld should be
+ relatively easy
e.g. systemd.
4. bld executes cmd fields({}) in the bld directory and then moves al
+l created files to the
source directory.
...
Bld FILE FORMAT
The Bld file(and Bld.gv) controls the entire target bld. It is divid
+ed into three sections -
Add comments before the EVAL line
EVAL
# mandatory defined variables
$bld="";
$bldcmd = "";
$lib_dirs = "";
$opt_s = "";
$opt_r = "";
$opt_lib = "";
DIRS
# {cmds} cmd blocks or '[R] dir:regex:{cmds}' specifications
{cmds}
'[R] dir:regex:{cmds}'
'[R] dir:regex:{cmds}'
...
1. a comment section
2. An EVAL(starts a line) section - this is perl code that is eval'ed
+ in bld. Six variables are required. These are:
e.g.
EVAL
#";
Any other simple perl variables can be defined in the EVAL sec
+tion and used in the DIRS section. Environment
variables may be set.
3. A DIRS(starts a line) section - this section will have either {cmd
+s} cmd blocks or '[R] dir:regex:{cmds}' specifications.
The {cmds} blocks are just a group of shell cmds, always executed.
+ A dir specification is a source directory relative
to the bld directory. The regex specification is a perl regular e
+xpression that will pick up one or more of the
source files in dir. The {cmds} specification describes how to bu
+ild the selected source files. Any number of
cmds, ';' separated, may be specified within the {} brackets.
Example Bld Files:
Simplest(Bld.example/example/Bld.example.helloworld-c):
The 'Hello World!' program with only the minimal required defi
+nitions.
EVAL
$CC = "gcc";
# mandatory defined variables
# the target to built e.g. executable, libx.a, libx.so
$bld="helloworld-c";
# cmd used in perl system() call to build $bld target - re
+quires '$bld'(target) and '$O'(object files) internally
$bldcmd = "$CC -o \$bld \$O";
# space separated list of directories to search for librar
+ies
$lib_dirs = " = "warnlibcheck";
DIRS
bld.example/example : ^helloworld\.c$ : { $CC -c $s; }
Complex(Bld.example/example/Bld.example.exec-c):
A well commented example of all of the features of a Bld file.
+ The code routines are all just stubs
designed to illustrate a Bld file.
EVAL
# this section will define perl variables to be interpolated i
+nto DIRS section cmd fields
# the compiler
$CC = "clang";
#";
# some examples of variables that will be interpolated into DI
+RS section cmd fields
$INCLUDE = "-I bld.example/example/include";
$LSOPTIONS = "-l";
# "a" or "b" to conditionally compile main.c
$COND = "a";
DIRS
# this section will have either {cmds} cmd blocks or '[R] dir:
+regex:{cmds}' specifications
# example of use of conditional compilation
bld.example/example/C : ^main\.c$ : {
# can have comments here too
if [ "$COND" == 'a' ];
then
$CC -S $INCLUDE $s;
fi
if [ "$COND" == 'b' ];
then
$CC -O4 -S $INCLUDE $s;
fi
}
# example of execution of a bare block of cmds - '{' and '}' m
+ay be on separate lines
{
ls $LSOPTIONS;
}
# the cmd field may be put on another line(s) and indented
bld.example/example/C : ^g\.x\.C$ :
{
$CC -c $INCLUDE $s;
}
# all three fields - dir, regex and cmd - may be put on separa
+te lines(even with extra blank lines).
# directories may have embedded blanks('a b').
bld.example/example/C/a b :
^m\.c$ :
{$CC -c $INCLUDE $s;}
# example of regex field that captures multiple source files(h
+.c and i.c) and example of a
# cmd field with multiple cmds - white space is irrelevant(a c
+hange should not cause a rebuild)
# example of cmd fields with multiple cmds(ls and $CC)
bld.example/example/C : ^(h|i)\.c$ : { ls -l $s; $CC
+-c $INCLUDE $s; }
# example of assembler source
# Note: the $CC compile produces .o output by changing the c t
+o an o.
# the as output needs to be specified by the -o option.
bld.example/example/C : ^main\.s$ : {as -c -o main.o $s;}
bld.example/example/C/ww : ^u\.c$ : {$CC -c $INCLUDE $s;}
# example of use of recursive directory search - the same rege
+x and cmd fields
# are applied to all subdirectories of the specified dir field
+(right after the 'R')
R bld.example/example/C/y : ^.*\.c$ : {$CC -c $INCLUDE $s;}
bld.example/example/C/x : ^t\.c$ : {$CC -c $INCLUDE $s;}
bld.example/example/C/z : ^(w|w1)\.c$ : {$CC -c $INCLUDE
+$s;}
# cmd blocks may execute multiple cmds(ls and pwd)
{
ls -lfda; pwd;
ls;
}
DIAGNOSTICS
Warnings(Warning ID(WID)):
...
Fatals(Fatal ID(FID)):
...
TODO/CONTEMPLATE/INVESTIGATE/EXAMINE/CHECKOUT/THINK ABOUT/HACK ON
...
INCOMPATIBILITIES
None Known
BUGS AND LIMITATIONS
None Known
SEE ALSO
bld.README
Critique of 'make': -
a detailed critique of make and some alternatives
+l#SEC3 -
a brief critique of make and how GNU automake from the GNU Bu
+ild System contributes -
an article "Recursive Make Considered Harmful" by Peter Mille
+r from the Australian UNIX Users Group
GITHUB RELEASES
bld-1.0.0.tar.gz - initial release
bld.git.git-1.9.rc0.tar.gz
bld.svn.subversion-1.8.5.tar.gz
bld.systemd.systemd-208.tar.gz
AUTHOR
Richard A Hogaboom
richard.hogaboom@gmail.com
LICENSE and COPYRIGHT and (DISCLAIMER OF) WARRANTY
...
[download]
Hell yes!
Definitely not
I guess so
I guess not
Results (41 votes),
past polls | http://www.perlmonks.org/index.pl?showspoiler=1027386-1;node_id=1044 | CC-MAIN-2014-52 | refinedweb | 7,739 | 65.22 |
Stores user state along with search context.
More...
#include <AStar.h>
Stores user state along with search context.
Definition at line 17 of file AStar.h.
List of all members.
constructor, pass parent node p, cost so far c, remaining cost heuristic r, and user state st
Definition at line 19 of file AStar.h.
cost to reach this node from start state
Definition at line 22 of file AStar.h.
Referenced by AStar::astar(), and AStar::Node< State >::CostCmp::operator()().
source for this search node
Definition at line 21 of file AStar.h.
Referenced by AStar::astar(), and AStar::reconstruct().
estimated cost remaining to goal
Definition at line 23 of file AStar.h.
user state
Definition at line 25 of file AStar.h.
Referenced by AStar::astar(), AStar::StateEq< State >::operator()(), AStar::StateHash< State >::operator()(), AStar::StateCmp< State, Cmp >::operator()(), and AStar::reconstruct().
cached value of cost + remain
Definition at line 24 of file AStar.h. | http://www.tekkotsu.org/dox/structAStar_1_1Node.html | CC-MAIN-2022-33 | refinedweb | 157 | 60.61 |
KEYCTL_GRANT_PERMISSION(3)ux Key Management CallsCTL_GRANT_PERMISSION(3)
keyctl_watch_key - Watch for changes to a key
#include <keyutils.h> long keyctl_watch_key(key_serial_t key, int watch_queue_fd int watch_id);
keyctl_watch_key() sets or removes a watch on key. watch_id specifies the ID for a watch that will be included in notification messages. It can be between 0 and 255 to add a key; it should be -1 to remove a key. watch_queue_fd is a file descriptor attached to a watch_queue device instance. Multiple openings of a device provide separate instances. Each device instance can only have one watch on any particular key. Notification Record Key-specific notification messages that the kernel emits into the buffer have the following format: struct key_notification { struct watch_notification watch; __u32 key_id; __u32 aux; }; The watch.type field will be set to WATCH_TYPE_KEY_NOTIFY and the watch.subtype field will contain one of the following constants, indicating the event that occurred and the watch_id passed to keyctl_watch_key() will be placed in watch.info in the ID field. The following events are defined: NOTIFY_KEY_INSTANTIATED This indicates that a watched key got instantiated or negatively instantiated. key_id indicates the key that was instantiated and aux is unused. NOTIFY_KEY_UPDATED This indicates that a watched key got updated or instantiated by update. key_id indicates the key that was updated and aux is unused. NOTIFY_KEY_LINKED This indicates that a key got linked into a watched keyring. key_id indicates the keyring that was modified aux indicates the key that was added. NOTIFY_KEY_UNLINKED This indicates that a key got unlinked from a watched keyring. key_id indicates the keyring that was modified aux indicates the key that was removed. NOTIFY_KEY_CLEARED This indicates that a watched keyring got cleared. key_id indicates the keyring that was cleared and aux is unused. NOTIFY_KEY_REVOKED This indicates that a watched key got revoked. key_id indicates the key that was revoked and aux is unused. NOTIFY_KEY_INVALIDATED This indicates that a watched key got invalidated. key_id indicates the key that was invalidated and aux is unused. NOTIFY_KEY_SETATTR This indicates that a watched key had its attributes (owner, group, permissions, timeout) modified. key_id indicates the key that was modified and aux is unused. Removal Notification When a watched key is garbage collected, all of its watches are automatically destroyed and a notification is delivered to each watcher. This will normally be an extended notification of the form: struct watch_notification_removal { struct watch_notification watch; __u64 id; }; The watch.type field will be set to WATCH_TYPE_META and the watch.subtype field will contain WATCH_META_REMOVAL_NOTIFICATION. If the extended notification is given, then the length will be 2 units, otherwise it will be 1 and only the header will be present. The watch_id passed to keyctl_watch_key() will be placed in watch.info in the ID field. If the extension is present, id will be set to the ID of the destroyed key.
On success keyctl_watch_key() returns 0 . On error, the value -1 will be returned and errno will have been set to an appropriate error.
ENOKEY The specified key does not exist. EKEYEXPIRED The specified key has expired. EKEYREVOKED The specified key has been revoked. EACCES The named key exists, but does not grant view permission to the calling process. EBUSY The specified key already has a watch on it for that device instance (add only). EBADSLT The specified key doesn't have a watch on it (removal only). Aug 2019 KEYCTL_GRANT_PERMISSION(3)
Pages that refer to this page: keyctl(3) | https://michaelkerrisk.com/linux/man-pages/man3/keyctl_watch_key.3.html | CC-MAIN-2022-27 | refinedweb | 568 | 58.69 |
An organization wants to use encryption to protect classified information from eavesdroppers. The organization has developed an algorithm that encodes a string of characters into a series of integers between 0 and 94, inclusive. You have been asked to develop an application that decrypts this series of integers into its corresponding string of characters. The user should enter each integer of the encrypted message one at a time. After each integer is entered, the application should convert (that is, decrypt) the integer to its corresponding character, after which the application should display the string of characters that have already been decrypted. If the user enters a value that is less than zero or greater than 94, the application should terminate input.
2. Adding a global variable. Before main, add a definition for a string named message, which will hold the decrypted message. Initialize message to the empty string. Use one line for a comment.
3. Declaring a function prototype. After the variable you defined in Step 3, declare a function prototype for the decryptLetter function, which accepts an int parameter and does not return a value.
4. Defining a local variable, prompting the user for and storing the encrypted letter. Add code in main to define int variable named input, then prompt the user for and store the encrypted letter in that variable.
5. Testing the user input. Insert a while repetition statement that executes while the user input is in the range 0 to 94. This ensures that input terminates when the user enters a sentinel value.
6. Decrypting the input. Inside the while statement, call the decryptLetter function with input as its argument. This function, which you will define in Step 9, will decrypt the letter and append the character to string message.
7. Displaying output and prompting the user for the next input. Inside the while statement, add code to display the string message. Before the closing brace of the while statement, add code to prompt the user for and store the next encrypted letter.
8. Decrypting the input. After main, define the decryptLetter function, which accepts int parameter encryptedLetter. Letters should be decrypted by first adding 32 to the int. This value should then be converted to a char type. [ Note: You can implicitly convert an int to a char by assigning the value of an int to a char variable.] This calculation results in the number 1 decrypting to the character '!' and the number 33 decrypting to the character ' A'. To append the decrypted character to message, use the += operator. For example, message += ' A' appends the character ' A' to the end of message.
#include <iostream> // required to perform C++ stream I/O #include <string> // required for parameterized stream manipulators using namespace std; // for accessing C++ Standard Library members //string string message; //will hold the encoded message //function prototype void decryptLetter(char encryptedLetter){ char decrypt = /* encryptLetter plus 32 */ message = // message plus decrypet //done } // function main begins program execution int main() { int input; // user input //prompt for user input cout <<"\nEnter encrypted letter ( 0-94; -1 to exit): "; cin >> input; while ( input > 0 && input < 94) { message = decryptLetter (input); } cout << "\n"; // insert newline for readability return 0; // indicate that program ended successfully } // end function main //define decryptLetterFunction void decryptLetter (int) { int encryptedLetter; }
THANKS FOR ANY HELP I CAN GET!!!!
Edited by WingedPanther, 10 November 2011 - 06:56 AM.
add code tags (the # button) | http://forum.codecall.net/topic/66667-decryption-help/ | crawl-003 | refinedweb | 565 | 55.24 |
Advanced Patterns¶
emcee is generally pretty simple but it has a few key features that make
the usage easier in real problems. Here are a few examples of things that
you might find useful.
Incrementally saving progress¶
It is often useful to incrementally save the state of the chain to a file. This makes it easier to monitor the chain’s progress and it makes things a little less disastrous if your code/computer crashes somewhere in the middle of an expensive MCMC run. If you just want to append the walker positions to the end of a file, you could do something like:
f = open("chain.dat", "w") f.close() for result in sampler.sample(pos0, iterations=500, storechain=False): position = result[0] f = open("chain.dat", "a") for k in range(position.shape[0]): f.write("{0:4d} {1:s}\n".format(k, " ".join(position[k]))) f.close()
Multiprocessing¶
In principle, running
emcee in parallel is as simple instantiating an
EnsembleSampler object with the
threads argument set to an
integer greater than 1:
sampler = emcee.EnsembleSampler(nwalkers, ndim, lnpostfn, threads=15)
In practice, the parallelization is implemented using the built in Python
multiprocessing
module. With this comes a few constraints. In particular, both
lnpostfn
and
args must be pickleable.
The exceptions thrown while using
multiprocessing can be quite cryptic
and even though we’ve tried to make this feature as user-friendly as possible,
it can sometimes cause some headaches. One useful debugging tactic is to
try running with 1 thread if your processes start to crash. This will
generally provide much more illuminating error messages than in the parallel
case. Note that the parallelized
EnsembleSampler object is not
pickleable. Therefore, if it (or an object that contains it) is passed to
lnpostfn when multiprocessing is turned on, the code will fail.
It is also important to note that the
multiprocessing module works by
spawning a large number of new
python processes and running the code in
isolation within those processes. This means that there is a significant
amount of overhead involved at each step of the parallelization process.
With this in mind, it is not surprising that running a simple problem like
the quickstart example in parallel will run much slower
than the equivalent serial code. If your log-probability function takes
a significant amount of time (> 1 second or so) to compute then using the
parallel sampler actually provides significant speed gains.
Arbitrary metadata blobs¶
Added in version 1.1.0
Imagine that your log-probability function involves an extremely computationally expensive numerical simulation starting from initial conditions parameterized by the position of the walker in parameter space. Then you have to compare the results of your simulation by projecting into data space (predicting you data) and computing something like a chi-squared scalar in this space. After you run MCMC, you might want to visualize the draws from your probability function in data space by over-plotting samples on your data points. It is obviously unreasonable to recompute all the simulations for all the initial conditions that you want to display as a part of your post-processing—especially since you already computed all of them before! Instead, it would be ideal to be able to store realizations associated with each step in the MCMC and then just display those after the fact. This is possible using the “arbitrary blob” pattern.
To use
blobs, you just need to modify your log-probability function to
return a second argument (this can be any arbitrary Python object). Then,
the sampler object will have an attribute (called
EnsembleSampler.blobs) that is a list (of length
niterations)
of lists (of length
nwalkers) containing all the accepted
blobs
associated with the walker positions in
EnsembleSampler.chain.
As an absolutely trivial example, let’s say that we wanted to store the sum of cubes of the input parameters as a string at each position in the chain. To do this we could simply sample a function like:
def lnprobfn(p): return -0.5 * np.sum(p ** 2), str(np.sum(p ** 3))
It is important to note that by returning two values from our log-probability
function, we also change the output of
EnsembleSampler.sample() and
EnsembleSampler.run_mcmc() to return 4 values (position, probability,
random number generator state and blobs) instead of just the first three.
Using MPI to distribute the computations¶
Added in version 1.2.0
The standard implementation of
emcee relies on the
multiprocessing
module to parallelize tasks. This works well on a single machine with
multiple cores but it is sometimes useful to distribute the computation
across a larger cluster. To do this, we need to do something a little bit
more sophisticated using the mpi4py module. Below, we’ll implement
an example similar to the quickstart using MPI but
first you’ll need to install mpi4py.
The
utils.MPIPool object provides most of the needed functionality
so we’ll start by importing that and the other needed modules:
import sys import numpy as np import emcee from emcee.utils import MPIPool
This time, we’ll just sample a simple isotropic Gaussian (remember that the
emcee algorithm doesn’t care about covariances between parameters
because it is affine-invariant):
ndim = 50 nwalkers = 250 p0 = [np.random.rand(ndim) for i in xrange(nwalkers)] def lnprob(x): return -0.5 * np.sum(x ** 2)
Now, this is where things start to change:
pool = MPIPool() if not pool.is_master(): pool.wait() sys.exit(0)
First, we’re initializing the pool object and then—if the process isn’t running as master—we wait for instructions and then exit. Then, we can set up the sampler providing this pool object to do the parallelization:
sampler = emcee.EnsembleSampler(nwalkers, ndim, lnprob, pool=pool)
and then run and analyse as usual. The key here is that only the master chain should actually directly interact with the sampler and the other processes should only wait for instructions.
Note: don’t forget to close the pool if you don’t want the processes to hang forever:
pool.close()
The full source code for this example is available on Github.
If we save this script to the file
mpi.py, we can then run this example
with the command:
mpirun -np 2 python mpi.py
for local testing.
Loadbalancing in parallel runs¶
Added in version 2.1.0
When
emcee is being used in a multi-processing mode (
multiprocessing or
mpi4py), the parameters need to distributed evenly over all the available
cores.
emcee uses a
map function to distribute the jobs over the available
cores. In case of
multiprocessing, the
map function is in-built and
dynamically schedules the tasks. In order to get a similar dynamic
scheduling in
map when using
utils.MPIPool , use the following
invocation:
pool = MPIPool(loadbalance=True)
By default,
loadbalance is set to
False. If your jobs have a lot of
variance in run-time, then setting the
loadbalance option will improve
the overall run-time.
If your problem is such that the runtime for each invocation of the
log-probability function scales with one/some of the parameters, then you can
improve load-balancing even further. By sorting the jobs in decreasing order
of (expected) run-time, the longest jobs get run simultaneously and you only
have the wait for the duration of the longest job. In the following example,
the first parameter strongly determines the run-time – larger the first
parameter, the longer the runtime. The
sort_on_runtime returns the
re-ordered list and the corresponding index.
def sort_on_runtime(pos): p = np.atleast_2d(p) idx = np.argsort(p[:, 0])[::-1] return p[idx], idx
In order to use this function, you will have to instantiate an
EnsembleSampler object with:
sampler = emcee.EnsembleSampler(nwalkers, ndim, lnprob, pool=pool, runtime_sortingfn=sort_on_runtime)
Such a
sort_on_runtime can be applied to both
multiprocessing
and
mpi4py invocations for
emcee. You can see a benchmarking
routine using the
mpi4py module on Github. | https://emcee.readthedocs.io/en/stable/user/advanced.html | CC-MAIN-2019-13 | refinedweb | 1,326 | 54.32 |
Each Answer to this Q is separated by one/two green lines.
Does somebody know how “modular” is Django? Can I use just the ORM part, to get classes that map to DB tables and know how to read/write from these tables?
If not, what would you recommend as “the Python equivalent of Hibernate”?
If you like Django’s ORM, it’s perfectly simple to use it “standalone”; I’ve written up several techniques for using parts of Django outside of a web context, and you’re free to use any of them (or roll your own).
Shane above seems to be a bit misinformed on this and a few other points — for example, Django can do multiple different databases, it just doesn’t default to that (you need to do a custom manager on the models which use something other than the “main” DB, something that’s not too hard and there are recipes floating around for it). It’s true that Django itself doesn’t do connection management/connection pooling, but personally I’ve always used external tools for that anyway (e.g.,
pgpool, which rocks harder than anything built in to an ORM ever could).
I’d suggest spending some time reading up and possibly trying a few likely Google searches (e.g., the post I linked you to comes up as the top result for “standalone Django script”) to get a feel for what will actually best suit your needs and tastes — it may be Django’s ORM isn’t right for you, and you shouldn’t use it if it isn’t, but unfortunately there’s a lot of misinformation out there which muddies the waters.
Editing to respond to Shane:
Again, you seem to be misinformed: SQLAlchemy needs to be configured (i.e., told what DB to use, how to connect, etc.) before you can run queries with it, so how is the fact that Django needs similar configuration (accomplished via your choice of methods — you do not need to have a full Django settings file) any disadvantage?
As for multiple DB support, you seem to be confused: the support is there at a low level. The query object — not
QuerySet, but the underlying
Query object it will execute knows what DB it’s connecting to, and accepts a DB connection as one of its initialization arguments. Telling one model to use one DB and another model to use another is as simple as setting up one method on a manager which passes the right connection info down into the
Query. True, there’s no higher-level API for this, but that’s not the same as “no support” and not the same as “requires custom code” (unless you’d argue that configuring multiple DBs explicitly in SQLAlchemy, required if you want multiple DBs, is also “custom code”).
As for whether you end up indirectly using things that aren’t in
django.db, well, so what? The fact that
django.db imports bits of, say,
django.utils because there are data structures and other bits of code which are useful for more than just an ORM is fine as far as I’m personally concerned; one might as well complain if something has external dependencies or makes use of standard Python libraries instead of being 100% self-contained.
The short answer is: no, you can’t use the Django ORM separately from Django.
The long answer is: yes, you can if you are willing to load large parts of Django along with it. For example, the database connection that is used by Django is opened when a request to Django occurs. This happens when a signal is sent so you could ostensibly send this signal to open the connection without using the specific request mechanism. Also, you’d need to setup the various applications and settings for the Django project.
Ultimately, it probably isn’t worth your time. SQL Alchemy is a relatively well known Python ORM, which is actually more powerful than Django’s anyway since it supports multiple database connections and connection pooling and other good stuff.
Edit: in response to James’ criticism elsewhere, I will clarify what I described in my original post. While it is gratifying that a major Django contributor has called me out, I still think I’m right 🙂
First off, consider what needs to be done to use Django’s ORM separate from any other part. You use one of the methods described by James for doing a basic setup of Django. But a number of these methods don’t allow for using the
syncdb command, which is required to create the tables for your models. A settings.py file is needed for this, with variables not just for
DATABASE_*, but also
INSTALLED_APPLICATIONS with the correct paths to all models.py files.
It is possible to roll your own solution to use
syncdb without a settings.py, but it requires some advanced knowledge of Django. Of course, you don’t need to use
syncdb; the tables can be created independently of the models. But it is an aspect of the ORM that is not available unless you put some effort into setup.
Secondly, consider how you would create your queries to the DB with the standard
Model.objects.filter() call. If this is done as part of a view, it’s very simple: construct the
QuerySet and view the instances. For example:
tag_query = Tag.objects.filter( name="stackoverflow" ) if( tag_query.count() > 0 ): tag = tag_query[0] tag.name="stackoverflowed" tag.save()
Nice, simple and clean. Now, without the crutch of Django’s request/response chaining system, you need to initialise the database connection, make the query, then close the connection. So the above example becomes:
from django.db import reset_queries, close_connection, _rollback_on_exception reset_queries() try: tag_query = Tag.objects.filter( name="stackoverflow" ) if( tag_query.count() > 0 ): tag = tag_query[0] tag.name="stackoverflowed" tag.save() except: _rollback_on_exception() finally: close_connection()
The database connection management can also be done via Django signals. All of the above is defined in django/db/init.py. Other ORMs also have this sort of connection management, but you don’t need to dig into their source to find out how to do it. SQL Alchemy’s connection management system is documented in the tutorials and elsewhere.
Finally, you need to keep in mind that the database connection object is local to the current thread at all times, which may or may not limit you depending on your requirements. If your application is not stateless, like Django, but persistent, you may hit threading issues.
In conclusion, it is a matter of opinion. In my opinion, both the limitations of, and the setup required for, Django’s ORM separate from the framework is too much of a liability. There are perfectly viable dedicated ORM solutions available elsewhere that are designed for library usage. Django’s is not.
Don’t think that all of the above shows I dislike Django and all it’s workings, I really do like Django a lot! But I’m realistic about what it’s capabilities are and being an ORM library is not one of them.
P.S. Multiple database connection support is being worked on. But it’s not there now.
(I’m reporting my solution because my question said to be a duplicate)
Ah ok I figured it out and will post the solutions for anyone attempting to do the same thing.
This solution assumes that you want to create new models.
First create a new folder to store your files. We’ll call it “standAlone”. Within “standAlone”, create the following files:
__init__.py myScript.py settings.py
Obviously “myScript.py” can be named whatever.
Next, create a directory for your models.
We’ll name our model directory “myApp”, but realize that this is a normal Django application within a project, as such, name it appropriately to the collection of models you are writing.
Within this directory create 2 files:
__init__.py models.py
Your going to need a copy of manage.py from an either an existing Django project or you can just grab a copy from your Django install path:
django\conf\project_template\manage.py
Copy the manage.py to your /standAlone directory. Ok so you should now have the following structure:
\standAlone __init__.py myScript.py manage.py settings.py \myApp __init__.py models.py
Add the following to your myScript.py file:
# settings.py from django.conf import settings settings.configure( DATABASE_ENGINE = "postgresql_psycopg2", DATABASE_NAME = "myDatabase", DATABASE_USER = "myUsername", DATABASE_PASSWORD = "myPassword", DATABASE_HOST = "localhost", DATABASE_PORT = "5432", INSTALLED_APPS = ("myApp") ) from django.db import models from myApp.models import *
and add this to your settings.py file:
DATABASE_ENGINE = "postgresql_psycopg2" DATABASE_NAME = "myDatabase" DATABASE_USER = "myUsername" DATABASE_PASSWORD = "myPassword" DATABASE_HOST = "localhost" DATABASE_PORT = "5432", INSTALLED_APPS = ("myApp")
and finally your myApp/models.py:
# myApp/models.py from django.db import models class MyModel(models.Model): field = models.CharField(max_length=255)
and that’s it. Now to have Django manage your database, in command prompt navigate to our /standalone directory and run:
manage.py sql MyApp
You can certainly use various parts of Django in a stand-alone fashion. It is after-all just a collection of Python modules, which you can import to any other code you would like to use them.
I’d also recommend looking at SQL Alchemy if you are only after the ORM side of things.
I’m using django ORM without a settings file. Here’s how:
In the stand-alone app launcher file:
from django.conf import settings from django.core.management import execute_from_command_line #Django settings settings.configure(DEBUG=False, DATABASES = { 'default': { 'ENGINE': 'django.db.backends.sqlite3', 'NAME': '/path/to/dbfile', 'USER': '', 'PASSWORD': '', 'HOST': '', 'PORT': '', } }, INSTALLED_APPS = ('modelsapp',) ) if not os.path.exists('/path/to/dbfile'): sync = ['manage.py', 'syncdb'] execute_from_command_line(sync)
Now you just need a
./modelsapp folder containing an
__init__.py and a
models.py. The config uses sqlite for simplicity sake, but it could use any of the db backends.
Folder structure:
./launcher.py ./modelsapp __init__.py models.py
Note that you don’t have to have a manage.py proper. The
import execute_from_command_line just finds it.
Using Django 2.0 ORM – One File Required
from myproject.config import parse_config from django import setup as django_setup from django.conf import settings as django_settings """ Requirements: ODBC Driver: Django Engine: """ config = parse_config() django_settings.configure( DEBUG=True, DATABASES={ 'default': { 'ENGINE': 'sql_server.pyodbc', 'NAME': config.database_name, 'HOST': config.database_server, # exclude '\\MSSQLSERVER' 'USER': config.database_username, 'PASSWORD': config.database_password, 'PORT': '', 'AUTOCOMMIT': False, 'OPTIONS': { 'driver': 'ODBC Driver 11 for SQL Server', }, }, }) django_setup() from django.db import models class Foo(models.Model): name = models.CharField(max_length=25) class Meta: app_label="myapp" # each model will require this
Take a look at django-standalone which makes this setup pretty easy.
I also found this blog entry quite useful.
This example is as simple as it gets. I already have a django app called thab up and running. I want to use the django orm in free standing python scripts and use the same models as I’m using for web programming. Here is an example:
# nothing in my sys.path contains my django project files import sys sys.path.append('c:\\apython\\thab') # location of django app (module) called thab where my settings.py and models.py is # my settings.py file is actualy in c:\apython\thab\thab from thab import settings as s # need it because my database setting are there dbs = s.DATABASES from django.conf import settings settings.configure(DATABASES=dbs) # configure can only be called once from thab.models import * boards = Board.objects.all() print 'all boards:' + str(boards) # show all the boards in my board table
Probably I’m quite late with my answer, but it’s better late than never.
Try this simple package:
How to use:
download
install
python setup.py install
create project
django-models-standalone startproject myproject
adjust files settings.py (DATABASES) and models.py, then migrate if tables not created
use djando models in your application (example.py)
import django from django.conf import settings from backend_mock.admin import settings as s settings.configure( DATABASES=s.DATABASES, INSTALLED_APPS=('backend_mock.admin.mocker', ) ) django.setup()
take a look at this, it’s working for django version gte 1.8.x
This is what worked for me in Django > 1.4
Assuming that your standalone script is your django project DIR.
Just copy this in a conf.py file (you can give it any name).
import os import sys import django BASE_DIR = os.path.dirname(os.path.dirname(os.path.abspath(__file__))) sys.path.append(BASE_DIR) #sys.path.append('c:\\apython\\thab') # location of django app (module) called thab where my settings.py and models.py is # my settings.py file is actualy in c:\apython\thab\thab from elsaserver import settings as s # need it because my database setting are there dbs = s.DATABASES from django.conf import settings settings.configure( DATABASES=dbs, INSTALLED_APPS=('core.apps.CoreConfig', )) #add all the apps you need here django.setup()
Then import the conf.py in your python script.
This is the project structure:
mydjangoproject | > app1 > core > app2 > standalone | | __init__.py | | conf.py | | myscript.py > manage.py
Can I use just the ORM part, to get classes that map to DB tables and know how to read/write from these tables?
Yes you can.
Here’s a clean and short explanation on how to use Django’s models and database abstraction:
Django version: 2.0.2
I understand this post is old, but in recent years I’ve found a smaller solution works great:
import os, sys import django # sys.path.append('/abs/path/to/my-project/) os.environ.setdefault('DJANGO_SETTINGS_MODULE', 'project.settings') django.setup() # Use from myapp import models kv = models.KeyValue()
Ensuring this script runs in the applicable relative directory, or apply the sys PATH append to ensure the modules are resolved.
Hope it helps.
You can use it outside a django project.
But there are there things you should be aware of.
1. Multiple database router.
A router looks like:
class Router(object): app_label="" def db_for_read(self, model, **hints): if model._meta.app_label == self.app_label: return self.app_label return None def db_for_write(self, model, **hints): if model._meta.app_label == self.app_label: return self.app_label return None def allow_relation(self, obj1, obj2, **hints): if obj1._meta.app_label == self.app_label or obj2._meta.app_label == self.app_label: return True return None def allow_migrate(self, db, app_label, model=None, **hints): if app_label == self.app_label: return db == self.app_label return None
You can use meta class to dynamic create router.
def add_db(db_conf): app_label="al_" + str(uuid4()) settings.DATABASES[app_label] = db_conf router_class_name="Router" + app_label.capitalize() setattr( settings, router_class_name, type(router_class_name, (Router,), dict(app_label=app_label)), ) settings.DATABASE_ROUTERS.append( '.'.join([settings.__name__, router_class_name]) ) connections.close_all() return app_label
2. Django settings.
the most important key is
TIME_ZONE.
DatetimeField and
DateField is releated to it.
A simplest setting should be:
SECRET_KEY = 'secret' DATABASES = {'default': {}} DATABASE_ROUTERS = [] TIME_ZONE = None
3.
close_old_connections.
Django framework default run close_old_connections in every request middleware to avoid “mysql has gone away“.
PS: I have written package to use django orm not in a classic django project,.
But you should always pay attention to the three problems above.My package use meta class to solve multi db, set
TIME_ZONE=None and leave
close_old_connections to user.
| https://techstalking.com/programming/python/using-only-the-db-part-of-django/ | CC-MAIN-2022-40 | refinedweb | 2,546 | 59.6 |
Feature #12624
!== (other)
Description
I'd like to suggest a new syntactic feature.
There should be an operator
!==
which should just return the negation of the
=== operator
aka:¶
def !==(other) ! (self === other) end
Rationale:¶
The
=== operator is well established.
The
!== operator would just return the negated truth value of
===
That syntax would mimick the duality of
== vs
!=
Impact:¶
To my best knowledge,
!== is currently rejected by the parser,
so there should be no exsiting code be affected by this change.
Do we really need that?¶
obviously
(! (a === b)) does the job,
while,
(a !== b) looks a bit more terse to me.
What's the use case?¶
I personally got a habit of using
=== in type checking arguments:
raise TypeError() unless (SomeClass === arg)
You might argue that I should write instead:
raise TypeError() unless arg.kind_of?(SomeClass)
(you are obviously right in that)
But the
=== operator is there for a reason,
and it is actually a strong point of ruby,
that we do not only have identity or equivalence,
but this third kind of object defined equality.
I believe, that in some cases
the intention of a boolean clause
would be easier to understand if we had that
!== operator
instead of writing
!(a===b)
I agree, syntax ahould not change.
But I believe that would add to the orthogonality.
Please see also:
my request on reserving the UTF operator plane for operators
Updated by duerst (Martin Dürst) almost 4 years ago
Eike Dierks wrote:
I believe, that in some cases
the intention of a boolean clause
would be easier to understand if we had that !== operator
instead of writing !(a===b)
We usually don't add new features to Ruby just based on 'belief'. If you think there are such use cases, please find them, in actual existing code.
Updated by nobu (Nobuyoshi Nakada) almost 4 years ago
I'm sometimes wanting it, too.
And can find some lines in standard libraries.
ext/psych/lib/psych/visitors/yaml_tree.rb:334: elsif not String === @ss.tokenize(o) or /\A0[0-7]*[89]/ =~ o lib/irb.rb:500: !(SyntaxError === exc) lib/optparse.rb:1353: if (!(String === o || Symbol === o)) and o.respond_to?(:match) lib/rdoc/class_module.rb:777: !(String === mod) && @store.modules_hash[mod.full_name].nil? lib/rdoc/class_module.rb:793: !(String === mod) && @store.modules_hash[mod.full_name].nil? lib/rdoc/parser/ruby.rb:244: break if first_comment_tk_class and not first_comment_tk_class === tk lib/resolv.rb:534: if reply.tc == 1 and not Requester::TCP === requester lib/resolv.rb:1028: !(Array === ns_port) || lib/resolv.rb:1030: !(String === ns_port[0]) || lib/resolv.rb:1031: !(Integer === ns_port[1]) lib/rubygems/security/signer.rb:51: @key and not OpenSSL::PKey::RSA === @key test/objspace/test_objspace.rb:76: assert_empty(arg.select {|k, v| !(Symbol === k && Integer === v)}, bug8014) test/rinda/test_rinda.rb:212: assert(!(tmpl === ro)) test/rinda/test_rinda.rb:218: assert(!(tmpl === ro)) test/rinda/test_rinda.rb:221: assert(!(tmpl === ro)) test/rinda/test_rinda.rb:230: assert(!(tmpl === ro)) test/ruby/test_m17n_comb.rb:1131: if [s, *args].all? {|o| !(String === o) || o.valid_encoding? }
Updated by shevegen (Robert A. Heiler) almost 4 years ago
I don't have any particular strong pro or con opinion here, but I should like to note that my bad eyes have it not so easy to distinguish between = == != =! !== ==!.
I actually think that !(String === mod) may be easier to read than (String !== mod) - the amount of characters saved is very negligible.
But it is just an opinion, as said, I have neither strong pro or con opinion on it really.
Updated by matz (Yukihiro Matsumoto) almost 4 years ago
- Status changed from Open to Rejected
The explicit use of
=== for type checking is against duck typing principle.
I don't accept syntax enhancement proposal to encourage something against duck typing in Ruby.
Matz.
Updated by jonathanhefner (Jonathan Hefner) 5 months ago
Recently, I had a use case for this. I was writing an assertion helper method which accepts a comparison operator (e.g.
:==,
:!=,
:===, etc) to
send to the expected value. For my use case, having
!== would be nice for a few reasons:
- Can express "assert not expected === actual" without the need for a "refute" method
- If defining a "refute" method, can implement it in terms of "assert" using operator inversion lookup table, i.e.
{ :== => :!=, :=== => :!==, :< => :>=, ... }
- Error messages can be expressed without special casing, i.e.
"Expected: #{expected.inspect} #{op} #{actual.inspect}"
Also available in: Atom PDF | https://bugs.ruby-lang.org/issues/12624 | CC-MAIN-2020-29 | refinedweb | 730 | 61.02 |
24 November 2011 04:01 [Source: ICIS news]
By Helen Yan
?xml:namespace>
Average spot prices of non-oil grade 1502 SBR rebounded $50/tonne week on week to $2,725/tonne (€2,017/tonne) CIF (cost and freight) China on 23 November, after shedding 45% since early August, ICIS data showed.
“We saw a surge in enquiries this week for SBR as traders and end-users are looking to restock ahead of the Lunar New Year next year, which falls in January,” an SBR producer said.
The Lunar New Year, which falls on 23 January 2012, is celebrated across
“It will be a short trading month in January next year as trades usually tend to slow down in China and other countries in Asia in the run-up to the festive holidays, so we have to book cargoes ahead for January delivery before we go off for the holidays,” a Chinese trader said.
A rebound in BD prices also led to expectations that SBR values will increase further, market sources said.
BD is a major feedstock in the production of SBR, making up more than 70% of SBR’s composition and cost.
In the week ended 18 November, BD prices were assessed at $1,700-1,750/tonne CFR NE Asia, up 9.5% week on week, according to ICIS. Until the rebound in prices this week, BD values had been falling for four straight months.
Further price increases can be expected because of tighter-than-expected supply as regional crackers either cut or shut production.
“As the feedstock BD price has rebounded and may rise to $2,000/tonne CFR NE Asia, we have no choice but to increase our SBR prices or our margins will fall into negative territory,” a northeast Asian SBR producer said.
However, some traders say the SBR price rebound may not be sustainable, as global demand remains weak with the eurozone struggling with a debt crisis, which is bad news for
“SBR prices may have rebounded and may rise further but we are not sure whether the price upturn can be sustainable if the global economy slows down,” a trader said.
SBR is a major raw material used in the production of tyres for the automotive industry.
( | http://www.icis.com/Articles/2011/11/24/9511087/asia-sbr-rebounds-on-restocking-to-extend-gains-on-rising-bd.html | CC-MAIN-2015-06 | refinedweb | 374 | 60.79 |
For code/output blocks: Use ``` (aka backtick or grave accent) in a single line before and after the block. See:
Data for Multiple Securities
- Dimitar Dimitrov last edited by
Hi guys,
I am trying to add data for multiple securities. I thought using a for loop could help, but it looks like something is wrong. It sais that "data" is not defined. If i define it as a DataFrame it does not work either. Can you please help?
Many thanks and regards,
Dimitar
import backtrader as bt import datetime import pandas_datareader as wb import pandas as pd if __name__=="__main__": cerebro = bt.Cerebro() symbols = ["SPY", "IWM", "QQQ", "EFA", "EEM","VNQ", "LQD", "GLD", "SHY", "IEF", "TLT", "AGG"] for i in symbols: data[i] = bt.feeds.YahooFinanceData(dataname=i, fromdate=datetime.datetime(2000,1,1), todate=datetime.datetime.today()) cerebro.adddata(data) cerebro.run() cerebro.plot()
In
cerebro.adddata(data)
datashould be
btdata feed object. In your script
datais a list of data feed objects, but not a single data feed object. Each data feed should be added to
cerebrousing separate
adddatacall. Search the forum, look up the docs and articles, this was discussed tons of times and described well. | https://community.backtrader.com/topic/3143/data-for-multiple-securities/1 | CC-MAIN-2022-05 | refinedweb | 198 | 57.77 |
tag:blogger.com,1999:blog-510594773915377610.post3498772351594205335..comments2017-10-05T22:45:56.626-07:00Comments on potatoes and carrots no bones: C String: startsWith, endsWith, indexOf, lastIndexOf in ANSI CBai Ben are right, thanks a lot for your corrections :...You are right, thanks a lot for your corrections :)<br /><br />Fixed.Bai Ben endsWith() doesn't work. It finds the fir...Your endsWith() doesn't work. It finds the first occurrence of str into base, and check if it's at the end. So<br /><br />endsWith("defdef", "def") will return false, as it will find pos as 0.<br /><br />Here's an alternative:<br /><br />bool endsWith(char* base, char* str)<br />{<br /> int blen = strlen(base);<br /> int slen = strlen(str);<br /> if (slen <= blen)<br /> {<br /> return (0 == strcmp(base + blen - slen, str));<br /> }<br /> return false;<br />}<br />Eryk | http://ben-bai.blogspot.com/feeds/3498772351594205335/comments/default | CC-MAIN-2017-43 | refinedweb | 144 | 74.39 |
How to choose between SAP Screen Personas 2.0 and 3.0. Start or Wait?
August 13, 2014 update
SAP Screen Personas 3.0 is now in ramp-up.
Original post
There has been a huge amount of interest in SAP Screen Personas, especially since the licensing changed in June 2014. While hundreds of customers felt the product was worth paying for, we have seen thousands of download since SAPPHIRE NOW. I suspect many of these people are now thinking about how to choose between whether to deploy SAP Screen Personas 2.0 now or wait until SAP Screen Personas 3.0 is available.
If you fall into this category, only you can make the decision about what is right for your organization. But, I will provide some guidance that I hope will help you choose whether to start now or wait.
Before making a technology decision, you need to:
- Understand the needs of the PEOPLE that will use simplified SAP screens
- Know their BUSINESS needs and what information is critical and what can be safely ignored
- Follow user-centric PROCESSES, such as design thinking, to identify and prioritize where to start
Preliminary conversations about SAP usability generally start with a discussion about business goals. Then, the focus shifts to the end user, aiming to address their specific needs for improved productivity and simplicity in their day-to-day roles. Some people follow the SAP Screen Personas getting started checklist to ensure that all the pieces are in place for a successful project.
Start with SAP Screen Personas 2.0 or wait for version 3.0? It depends on your go-live urgency.
Most likely, your decision will end up based on one key question: When do you want to roll out simplified screens to your employees?
If the answer is sooner rather than later, then immediately download Personas 2.0 and get to work. We have had several customers start and finish their projects with around six weeks. The finish line, of course, is having employees use simplified screens to complete their jobs. Freescale spoke at SAPPHIRE NOW about they rolled out streamlined HR transactions using SAP Screen Personas in less than six weeks.
The characteristics of customers that go live quickly with SAP Screen Personas are:
- Narrow and well-defined use case
- Dedicated and highly skilled staffing
- Compelling business need that creates sense of urgency to complete project quickly
- Continuous improvement mindset – willing to iterate until it’s right
If you are not in as much of a rush, then I still encourage you to start the process now. For many customers, it takes time to define the business scenario, conduct the user research, analyze the scenario, determine design themes, build design themes, create prototypes of screens, all before even touching the SAP Screen Personas software. By following a design thinking methodology, you obtain feedback early and often to ensure alignment with the business objectives, increasing the probability of success in your screen simplification project.
Once you understand and have analyzed all the issues, then you can start designing screens (starting with wire frames on a white board) and then building them in SAP Screen Personas. At that point, when you are ready to start building screens using SAP Screen Personas, then see what version of the software is available. This process will allow you to progress on your overall project, while deferring your decision on what version of SAP Screen Personas to use.
Or, you and your organization may make a strategic decision to wait for SAP Screen Personas 3.0. This option makes sense is you want to:
- Eliminate duplication of effort in training people on two very different versions of SAP Screen Personas
- Reduce the risk of migrating you flavors from SAP Screen Personas 2.0 to SAP Screen Personas 3.0
- Include advanced scripting in your flavors, which we plan to make easier in SAP Screen Personas 3.0
- Avoid Silverlight entirely in the context of SAP Screen Personas
We wish you success with your SAP Screen Personas project, whichever version you select.
For the SAP Screen Personas product team, Peter Spielvogel.
Hi Peter,
Few questions:
(1) is there any technical comparison between Personas 2.0 (silverlight) and 3.0 ? (In terms of functionalities or capabilities)
(2) will there be any tools provided for migration of flavors from Personas 2.0 (silverlight) to 3.0 ?
Regards,
Ferry Mulyadi
SAP don't usually disclose much detail about new products before they are released. That said, there's more information than usual about Personas v3, not least because it was demoed at ASUG/Sapphire last month. Peter gave some details here - How customer feedback shaped the future of SAP Screen Personas– SAPPHIRE NOW session summary - and I wrote up a summary here - SAP Screen Personas at SapphireNOW.
Both of those blog posts specifically address your migration question - the intention (intention, not promise) is that most v2 flavours should migrate automatically, with little or no manual intervention required.
I think it is also fair to say that the intention is that v3 should be largely as capable functionally as v2. The underlying technology is different, though, so don't be surprised if there are minor differences.
Steve.
Thanks Steve, this clarified my questions earlier.
Is there any release date for Personas 3.0 available?
Thanks
The only dates so far made public are in this blog: SAP Screen Personas HTML update. In summary, "planned for 2014".
Steve.
Just in case you haven't seen the announcement yet - Announcing SAP Screen Personas 3.0. Ramp-up has started...
Great news, scripting features in JS should help hopefully!
Hi Peter,
Exciting news. Is there a list of pre-requisites for Personas 3.0 available somewhere?
Thanks,
Glenn
Hi Glenn,
The technical requirements are listed here:
Regards,
Peter
Hi Peter,
Does Personas 3.0 have system selection screen as 2.0? Do we need to install 3.0 on every system?
Thanks,
Chan
Hi Chan,
Due to the architectural changes in SAP Screen Personas 3.0, you need to install the add-on onto every system where you want to consume simplified screens.
Regards,
Peter
Hello Peter Spielvogel,
at this moment, which product option do you recommend us to take (personas 200 or personas 300) ? considering that we are planning the deployment in a SAP sandbox client system.
thanks in advance,
Rodolfo
Hi Rodolfo,
There is no one-size-fits-all answer, as each product has certain advantages.
At this point (March 2015, still during ramp-up), we recommend that most new customers start now on SAP Screen Personas 2.0 (very mature and stable product) and then migrate to SAP Screen Personas 3.0 when they feel ready. SAP Screen Personas 2.0 SP3 (available end of March 2015) significantly improves performance, which was one of the reasons some customers wanted to wait for version 3.0.
When you are ready to migrate from SAP Screen Personas 2.0 to 3.0, the process is very simple and you will preserve the work you have done on simplifying your screens and business processes.
Good luck on your project!
Regards,
Peter
Thank you Peter Spielvogel , I really appreciate your comments, always very valuable and precise.
Regards,
Rodolfo
Hi Peter,
Is the Personas 3.0 still on schedule for end Q2 release?
We have immediate need for personas. Should we wait until end of June or proceed with Personas 2.0?
Thanks & Regards,
Helly
Hi Helly,
SAP Screen Personas 3.0 is currently in ramp-up, and we are still planning to release as GA at end of Q2. I would recommend you proceed with version 2.0 and go live. SAP Screen Personas 2.0 is a very stable and mature product. We have many customers running this in production around the world.
The approach is identical between the two versions. The hard work of understanding user requirements and streamlining business processes is the same. You do this independent of the tool. The screens are different, but easy to learn in both cases.
Once you are live on version 2.0, you can migrate to 3.0 at your convenience after the product is generally available and you have the necessary pre-requisites in place. We plan to release SAP Screen Personas 3.0 as GA at the end of June. Migrating your work from 2.0 to 3.0 is fast and easy, so your work will be preserved.
Recommendation: start now on SAP Screen Personas 2.0
Regards,
Peter
Thanks Peter.
We will start with Personas 2.0 then.
Best Regards,
Helly
Dear Peter,
I was attending your SAP Screen Personas 3.0 Open SAP Course and enjoyed it very much. To extend our knowlege of Personas 3.0 will activated the Free Personas 3.0 solution on the Cloud Application Library.
Unfortunately the solution expired today (in the middle of doing some flavor creating). In an other blog post i read that GA of Personas 3.0 will be by the end of june 2015. We would love to use the CAL solution of Personas 3.0 to learn more and to be ready for our customers when Personas 3.0 is general available.
Do you see any chance to prolongt the CAL solution ?
For us using Personas 2.0 and afterwards migrate to 3.0 is not an opportunity. We want to use the time till end of june to earn knowlege with 3.0 but don't have the chance to do so. Unfortunately we missed the ramp-up for 3.0.
Best Regards,
Thomas
Hi Thomas,
Unfortunately, we cannot extend the CAL image.
If you are a partner (sounds like this, as you are preparing to be ready for your customers), you can download SAP Screen Personas 3.0 through SAP Partner Edge. Please email me if you are not able to do this.
Otherwise, you will need to wait for general availability.
Regards,
Peter
Dear Peter,
yes we at Swisscom are both Partner and Customer. Could you please help me with the download ? My colleague could not found a download link at the SAP Partner Edge.
Thx for your Support.
Regards,
Thomas
Hi,
I am not sure if I understand correctly the difference between 2.0 and 3.0
I have personas 2.0 sp2 in my system. and now that 3.0 is released, i have installed the component. But both 2.0 and 3.0 seems to exist together in the same system.
It looks like everything under namespace /persos/ are from version 2 and /personas/ are from version 3.
Also, in version 2. I configured a multiple system landscape, i have a dedicated netweaver system just for personas and this connect to other erp system. User is able to select which systems they want to connect to when they logon to the personas netweaver system.
But in version 3, i dont seem to find this configuration. seems like there is no multi system setup for personas 3?
Hi,
Personas 2 and Personas 3 can coexist in the same system. They don't influence each other.
Because of being integrated deeper into the system, Personas 3 needs to be installed on each system, where you want to use it.
Regards
Björn
Thanks.
Then i think this reference guide is wrong.
And the author mixed up elements from version 2 and 3.
You are correct - that document is wrong. It looks like it has been copied from the Personas 2 documentation. I'm not sure any of it is relevant. I suggest ignoring it. I'll contact the relevant people and get it removed...
Steve.
Indeed, the linked article is wrong since it is a copy of the Personas 2.0-related information under the 3.0 title.
It will be corrected. | https://blogs.sap.com/2014/07/21/how-to-choose-between-sap-screen-personas-20-and-30-start-or-wait/ | CC-MAIN-2021-39 | refinedweb | 1,970 | 76.22 |
On 10/12/2011 08:31 PM, Serge E. Hallyn wrote:
glibc's grantpt and ptsname cannot be used on a fd for a pty not in /dev/pts. The lxc controller tries to do just that. So if you try to start a container on a system where /dev/pts/0 is not available, it will fail. You can make this happen by opening a terminal on /dev/pts/0, and doing 'sleep 2h& disown; exit'. To fix this, I call the virFileOpenTtyAt() from a forked task in a new mount ns, and first mount the container's /dev/pts onto /dev/pts. (Then the opened fd must be passed back to the lxc driver). Another solution would be to just do it all by hand without grantpt and ptsname. Bug-Ubuntu: Signed-off-by: Serge Hallyn<serge hallyn canonical com> --- src/lxc/lxc_controller.c | 117 ++++++++++++++++++++++++++++++++++++++++++++-- 1 files changed, 112 insertions(+), 5 deletions(-) diff --git a/src/lxc/lxc_controller.c b/src/lxc/lxc_controller.c index 51488e7..1a56e0c 100644 --- a/src/lxc/lxc_controller.c +++ b/src/lxc/lxc_controller.c @@ -780,6 +780,113 @@ static int lxcSetPersonality(virDomainDefPtr def) # define MS_SLAVE (1<<19) #endif +static int send_pty(int sock, int *pty) +{ + struct iovec vector; + struct msghdr msg; + struct cmsghdr * cmsg; + int ret; +
Yuck. Why not just use gnulib's sendfd/recvfd interfaces, and greatly shrink the size of this patch? We're already using those functions elsewhere, for much more compact fd passing.Yuck. Why not just use gnulib's sendfd/recvfd interfaces, and greatly shrink the size of this patch? We're already using those functions elsewhere, for much more compact fd passing.
+ if (VIR_ALLOC_N(*path, PATH_MAX)< 0) { + virReportSystemError(errno, "%s", + _("Failed to allocate space for ptyname")); + return -ENOMEM; + } + //snprintf(*path, PATH_MAX, "%s/0", devpts);
Also, looks like you left some debug stuff behind. Have you filed a bug against glibc's grantpt? -- Eric Blake eblake redhat com +1-801-349-2682 Libvirt virtualization library | https://www.redhat.com/archives/libvir-list/2011-October/msg00606.html | CC-MAIN-2014-10 | refinedweb | 327 | 66.23 |
Consolidated lecture notes for CS223 as taught in the Spring 2011 semester at Yale by Jim Aspnes.
Contents
- WhyYouShouldLearnC
- HowToCompileAndRunPrograms
- Creating the program
- Compiling and running a program
- Some notes on what the program does
- HowToUseTheComputingFacilities
- Using the Zoo
- Using Unix
- Editing C programs
- Compiling programs
- Debugging
- Version control
- Submitting assignments
- C/Variables
- Machine memory
- Variables
- Using variables
- C/IntegerTypes
- Integer types
- Integer constants
- Integer operators
- Input and output
- Alignment
- C/InputOutput
- Character streams
- Reading and writing single characters
- Formatted I/O
- Rolling your own I/O routines
- File I/O
- C/Statements
- Simple statements
- Compound statements
- C/FloatingPoint
- Floating point basics
- Floating-point constants
- Operators
- Conversion to and from integer types
- The IEEE-754 floating-point standard
- Error
- Reading and writing floating-point numbers
- Non-finite numbers in C
- The math library
- C/Functions
- Function definitions
- Calling a function
- The return statement
- Function declarations and modules
- Static functions
- Local variables
- Mechanics of function calls
- C/Pointers
- Memory and addresses
- Pointer variables
- The null pointer
- Pointers and functions
- Pointer arithmetic and arrays
- Void pointers
- Run-time storage allocation
- The restrict keyword
- C/Strings
- String processing in general
- C strings
- String constants
- String buffers
- Operations on strings
- Finding the length of a string
- Comparing strings
- Formatted output to strings
- Dynamic allocation of strings
- argc and argv
- C/Structs
- Structs
- Unions
- Bit fields
- AbstractDataTypes
- Abstraction
- Example of an abstract data type
- Designing abstract data types
- C/Definitions
- Naming types
- Naming constants
- Naming values in sequences
- Other uses of #define
- C/Debugging
- Debugging in general
- Assertions
- gdb
- Valgrind
- Not recommended: debugging output
- AsymptoticNotation
- Definitions
- Motivating the definitions
- Proving asymptotic bounds
- Asymptotic notation hints
- Variations in notation
- More information
- LinkedLists
- Stacks and linked lists
- Looping over a linked list
- Looping over a linked list backwards
- Queues
- Deques and doubly-linked lists
- Circular linked lists
- What linked lists are and are not good for
- Further reading
- C/Recursion
- Example of recursion in C
- Common problems with recursion
- Tail-recursion versus iteration
- An example of useful recursion
- C/HashTables
- Dictionary data types
- Basics of hashing
- Resolving collisions
- Choosing a hash function
- Maintaining a constant load factor
- Examples
- BinaryTrees
- Tree basics
- Binary tree implementations
- The canonical binary tree algorithm
- Nodes vs leaves
- Special classes of binary trees
- BinarySearchTrees
- Searching for a node
- Inserting a new node
- Costs
- BalancedTrees
- The basics: tree rotations
- AVL trees
- 2–3 trees
- Red-black trees
- B-trees
- Splay trees
- Skip lists
- Implementations
- C/AvlTree
- Header file
- Implementation
- Test code and Makefile
- Heaps
- Priority queues
- Expensive implementations of priority queues
- Heaps
- Packed heaps
- Bottom-up heapification
- Heapsort
- More information
- C/FunctionPointers
- Basics
- Function pointer declarations
- Applications
- Closures
- Objects
- C/Iterators
- The problem
- Option 1: Function that returns a sequence
- Option 2: Iterator with first/done/next operations
- Option 3: Iterator with function argument
- Appendix: Complete code for Nums
- C/Randomization
- Generating random values in C
- Randomized algorithms
- Randomized data structures
- RadixSort
- What's wrong with comparison-based sorting
- Bucket sort
- Classic LSB radix sort
- MSB radix sort
- RadixSearch
- Tries
- Patricia trees
- Ternary search trees
- More information
- DynamicProgramming
- Memoization
- Dynamic programming
- Dynamic programming: algorithmic perspective
- C/Graphs
- Graphs
- Why graphs are useful
- Operations on graphs
- Representations of graphs
- Searching for paths in a graph
- ShortestPath
- Single-source shortest paths
- All-pairs shortest paths
- Implementations
- SuffixArrays
- Why do we want to do this?
- String search algorithms
- Suffix trees and suffix arrays
- Burrows-Wheeler transform
- Sample implementation
- C++
- Hello world
- References
- Function overloading
- Classes
- Operator overloading
- Templates
- Exceptions
- Storage allocation
- Standard library
- Things we haven't talked about
1. WhyYouShouldLearnC
Why.
2. HowToCompileAndRunPrograms
See HowToUseTheComputingFacilities for details of particular commands. The basic steps are
Creating the program with a text editor of your choosing. (I like vim for long programs and cat for very short ones.)
Compiling it with gcc.
- Running it.
If any of these steps fail, the next step is debugging. We'll talk about debugging elsewhere.
3. Creating the program
Use your favorite text editor. The program file should have a name of the form foo.c; the .c at the end tells the C compiler the contents are C source code. Here is a typical C program:
4. Compiling and running a program
Here's what happens when I compile and run it on the Zoo:
$ gcc -o count count.c $ ./count Now I will count from 1 to 10 1 2 3 4 5 6 7 8 9 10 $
The first line is the command to compile the program..
5. Some notes on what the program does
Noteworthy features of this program include:
The #include <stdio.h> in line 1. This is standard C boilerplate, and will appear in any program you see that does input or output. The meaning is to tell the compiler to include the text of the file /usr/include/stdio.h.
Line 3 is a comment; its beginning and end is marked by the /* and */ characters. Comments are ignored by the compiler but can be helpful for other programmers looking at your code (including yourself, after you've forgotten why you wrote something).
Lines 5 and 6 declare the main function. Every C program has to have a main function declared in exactly this way---it's what the operating system calls when you execute the program. The int on Line 3 says that main returns a value of type int (we'll describe this in more detail later in C/Functions), and that it takes two arguments: argc of type int, the number of arguments passed to the program from the command line, and argv, of a pointer type that we will get to eventually (C/Pointers), which is an array of the arguments (essentially all the words on the command line, including the program name). Note that it would also work to do this as one line (as KerniganRitchie typically does); the C compiler doesn't care about whitespace, so you can format things however you like, subject to the constraint that consistency will make it easier for people to read your code.
Everything inside the curly braces is the body of the main function. This includes
The declaration int i;, which says that i will be a variable that holds an int (C/IntegerTypes).
Line 10, which prints an informative message using puts (C/InputOutput).
The for loop on Lines 11–13, which executes its body for each value of i from 1 to 10. We'll explain how for loops work later (C/Statements). Note that the body of the loop is enclosed in curly braces just like the body of the main function. The only statement in the body is the call to printf on Line 12; this includes a format string that specifies that we want a decimal-formatted integer followed by a newline (the \n).
The return 0; on Line 15 tells the operating system that the program worked (the convention in Unix is that 0 means success). If the program didn't work for some reason, we could have returned something else to signal an error.
6. HowToUseTheComputingFacilities
Contents
- Using the Zoo
- Using Unix
- Editing C programs
- Compiling programs
- Debugging
- Version control
- Submitting assignments
7. Using the Zoo
The best place for information about the Zoo is at. Below are some points that are of particular relevance for CS223 students.
7.1. Getting an account.
7.2. Getting into the room.
7.3. Remote use
See HowToUseTheZooRemotely.
8. Using Unix.
8.1. Getting a shell prompt in the Zoo.
8.2. The Unix filesystem.
8.3. Unix command-line programs
Here are some handy Unix commands:
- man
man program will show you the on-line documentation for a program (e.g., try man man or man ls). Handy if you want to know what a program does. On Linux machines like the ones in the Zoo you can also get information using info program, which has an Emacs-like interface.
- ls
ls lists all the files in the current directory. Some useful variants:
ls /some/other/dir; list files in that directory instead.
ls -l; long output format showing modification dates and owners.
- mkdir
mkdir dir will create a new directory in the current directory named dir.
- rmdir
rmdir dir deletes a directory. It only works on directories that contain no files.
- cd
cd dir changes the current working directory. With no arguments, cd changes back to your home directory.
- pwd
pwd ("print working directory") shows what your current directory is.
- mv
mv old-name new-name changes the name of a file. You can also use this to move files between directories.
- cp
cp old-name new-name makes a copy of a file.
- rm
rm file deletes a file. Deleted files cannot be recovered. Use this command carefully.
- chmod
- See corresponding sections.
8.4. Stopping and interrupting programs.
- ctrl-C
Interrupt the process. Many processes (including any program you write unless you trap SIGINT using the sigaction system call) will die instantly when you do this. Some won't.
- ctrl-Z
Suspend the process. This will leave a stopped process lying around. Type jobs to list all your stopped processes, fg to restart the last process (or fg %1 to start process %1 etc.), bg to keep running the stopped process in the background, kill %1 to kill process %1 politely, kill -KILL %1 to kill process %1 whether it wants to die or not.
- ctrl-D
Send end-of-file to the process. Useful if you are typing test input to a process that expects to get EOF eventually or writing programs using cat > program.c (not really recommmended). For test input, you are often better putting it into a file and using input redirection (./program < test-input-file); this way you can redo the test after you fix the bugs it reveals.
- ctrl-\
- Quit the process. Sends a SIGQUIT, which asks a process to quit and dump core. Mostly useful if ctrl-C and ctrl-Z don't work..
8.5. Running your own programs'
8.6. Input and output.
9. Editing C programs.
9.1. Writing C programs with Emacs.
9.1.1. My favorite Emacs commands
General note: C-x means hold down Control and press x; M-x means hold down Alt (Emacs calls it "Meta") and press x. For M-x you can also hit Esc and then x.
- C-h
Get help. Everything you could possibly want to know about Emacs is available through this command. Some common versions: C-h t puts up the tutorial, C-h b lists every command available in the current mode, C-h k tells you what a particular sequence of keystrokes does, and C-h l tells you what the last 50 or so characters you typed were (handy if Emacs just garbled your file and you want to know what command to avoid in the future).
- C-x u
Undo. Undoes the last change you made to the current buffer. Type it again to undo more things. A lifesaver. Note that it can only undo back to the time you first loaded the file into Emacs--- if you want to be able to back out of bigger changes, use git (described below).
- C-x C-s
- Save. Saves changes to the current buffer out to its file on disk.
- C-x C-f
- Edit a different file.
- C-x C-c
Quit out of Emacs. This will ask you if you want to save any buffers that have been modified. You probably want to answer yes (y) for each one, but you can answer no (n) if you changed some file inside Emacs but want to throw the changes away.
- C-f
- Go forward one character.
- C-b
- Go back one character.
- C-n
- Go to the next line.
- C-p
- Go to the previous line.
- C-a
- Go to the beginning of the line.
- C-k
Kill the rest of the line starting with the current position. Useful Emacs idiom: C-a C-k.
- C-y
- "Yank." Get back what you just killed.
- TAB
- Re-indent the current line. In C mode this will indent the line according to Emacs's notion of how C should be indented.
- M-x compile
Compile a program. This will ask you if you want to save out any unsaved buffers and then run a compile command of your choice (see the section on compiling programs below). The exciting thing about M-x compile is that if your program has errors in it, you can type C-x ` to jump to the next error, or at least where gcc thinks the next error is.
9.2. Using Vi instead of Emacs
If you don't find yourself liking Emacs very much, you might want to try Vim instead. Vim is a vastly enhanced reimplementation of the classic vi editor, which I personally find easier to use than Emacs. Type vimtutor to run the tutorial. You can always get out by hitting the Escape key a few times and then typing :qa! .
For more details, see UsingVim.
10. Compiling programs
10.1. Using
By default, gcc doesn't check everything that might be wrong with your program. But if you give it a few extra arguments, it will warn you about many (but not all) potential problems: gcc -g3 -Wall -std=c99 -pedantic -o foo foo.c
10.2. Using make -std=c99 -pedantic" in your CFLAGS. CC=gcc CFLAGS=-g3 -Wall -std=c99 -pedantic #. Note the use of the CC and CFLAGS # variables. $(CC) $(CFLAGS) -o hello-world hello-world.o hello-library.o echo "I just built hello-world! Hooray!" # We can also declare that several things depend on one thing. # Here we are saying that hello-world.o and hello-library.o # should be rebuilt whenever hello-library.h changes. # There are no commands attached to this dependency line, so # make will have to figure out how to do that somewhere else # (probably from the builtin .c -> .o rule). hello-world.o hello-library.o: hello-library.h # Command lines can do more than just build things. For example, # "make test" will rebuild hello-world (if necessary) and then run it. test: hello-world ./hello-world # This lets you type "make clean" and get rid of anything you can # rebuild. The -f tells rm not to complain about files that aren't # there. clean: rm -f).
10.2.1. Make gotchas
11. Debugging
The standard debugger on the Zoo is gdb. See C/Debugging.
12. Version control. For details, see UsingGit, or look at the tutorials available at.
13. Submitting assignments.
14. C/Variables
15. Machine memory
Basic model: machine.
16. Variables).
16.1. Variable declarations
Before you can use a variable in C, you must declare it. Variable declarations show up in three places:
Outside a function. These declarations declare global variables that are visible throughout the program (i.e. they have global scope). Use of global variables is almost always a mistake.
In the argument list in the header of a function. These variables are parameters to the function. They are only visible inside the function body . Such variables are visible only within the block (local scope again) and exist only when the containing function is active (bounded extent). The convention in C is has generally been to declare all such local variables at the top of a function; this is different from the convention in C++ or Java, which encourage variables to be declared when they are first used. This convention may be less strong in C99 code, since C99 adopts the C++ rule of allowing variables to be declared anywhere (which can be particularly useful for index variables in for loops).:
1 #include <stdio.h> 2 #include <ctype.h> 3 4 /* This program counts the number of digits in its input. */ 5 6 /* 7 *This global variable is not used; it is here only to demonstrate 8 * what a global variable declaration looks like. 9 */ 10 unsigned long SpuriousGlobalVariable = 127; 11 12 int 13 main(int argc, char **argv) 14 { 15 int c; /* character read */ 16 int count = 0; /* number of digits found */ 17 18 while((c = getchar()) != EOF) { 19 if(isdigit(c)) { 20 count++; 21 } 22 } 23 24 printf("%d\n", count); 25 26 return 0; 27 }
16.2. Variable names
The evolution of variable names in different programming languages:
- 11101001001001
- Physical addresses represented as bits.
- #FC27
- Typical assembly language address represented in hexadecimal to save typing (and because it's easier for humans to distinguish #A7 from #B6 than to distinguish 10100111 from 10110110.)
- A1$
- A string variable in BASIC, back in the old days where BASIC variables were one uppercase letter, optionally followed by a number, optionally followed by $ for a string variable and % for an integer variable. These type tags were used because BASIC interpreters didn't have a mechanism for declaring variable types.
- IFNXG7
A typical FORTRAN variable name, back in the days of 6-character all-caps variable names. The I
Typical names from modern C programs. There is no type information contained in the name; the type is specified in the declaration and remembered by the compiler elsewhere. Note that there are two different conventions for representing multi-word names: the first is to replace spaces with underscores, and the second is to capitalize the first letter of each word (possibly excluding the first letter), a style called "camel case" (CamelCase). You should pick one of these two conventions and stick to it.
- expect to have fractional students for some reason. See or HungarianNotation. Not clearly an improvement on standard naming conventions, but it is popular in some programming shops.
In C, variable names are called identifiers.1, i.e., that are once.:
Ordinary variables and functions are lowercased or camel-cased, e.g. count, countOfInputBits.
User-defined types (and in some conventions global variables) are capitalized, e.g. Stack, TotalBytesAllocated.
Constants created with #define or enum are put in all-caps: MAXIMUM_STACK_SIZE, BUFFER_LIMIT.
17. Using variables
Ignoring pointers (C/Pointers) for the moment, there are essentially two things you can do to a variable: you can assign a value to it using the = operator, as in:
or you can use its value in an expression:++ by itself as a substitute for x = x+1 is perfectly acceptable style.
18. C/IntegerTypes
19. Integer types
In order to declare a variable, you have to specify a type, which controls both how much space the variable takes up and how the bits stored within it are interpreted in arithmetic operators.
The standard C integer types are.
19.1. C99 fixed-width types
C99 provides a stdint.h header file that defines integer types with known size independent of the machine architecture. So in C99, you can use int8_t instead of signed char to guarantee a signed type that holds exactly 8 bits, or uint64_t instead of unsigned long long to get a 64-bit unsigned integer type. The full set of types typically defined are int8_t, int16_t, int32_t, and int64_t for signed integers and the same starting with uint for signed integers. There are also types for integers that contain the fewest number of bits greater than some minimum (e.g., int_least16_t is a signed type with at least 16 bits, chosen to minimize space) or that are the fastest type with at least the given number of bits (e.g., int_fast16_t is a signed type with at least 16 bits, chosen to minimize time)..
20..3 Unlike languages with separate character types, C characters are identical to integers; you can (but shouldn't) calculate 972 by writing 'a'*'a'. You can also store a character anywhere.
Except for character constants, you can insist that an integer constant is unsigned or long by putting a u or l after it. So 1ul is an unsigned long version of 1. By default integer constants are (signed) ints. For long long constants, use ll, e.g., the unsigned long long constant 0xdeadbeef01234567ull. It is also permitted to write the l as L, which can be less confusing if the l looks too much like a 1.
21. Integer operators
21.1. Arithmetic operators
The usual + (addition), - (negation or subtraction), and * (multiplication) operators work on integers pretty much the way you'd expect. The only caveat is that if the result lies outside of the range of whatever variable you are storing it in, it will be truncated instead of causing an error:
This can be a source of subtle bugs if you aren't careful. The usual giveaway is that values you thought should be large positive integers come back as random-looking negative integers.
Division (/) of two integers also truncates: 2/3 is 0, 5/3 is 1, etc. For positive integers it will always round down.
Prior to C99, if either the numerator or denominator is negative, the behavior was unpredictable and depended on what your processor does---in practice this meant you should never use / if one or both arguments might be negative. The C99 standard specified that integer division always removes the fractional part, effectively rounding toward 0; so (-3)/2 is -1, 3/-2 is -1, and (-3)/-2 is 1.
There is also a remainder operator % with e.g. 2%3 = 2, 5%3 = 2, 27 % 2 = 1, etc. The sign of the modulus is ignored, so 2%-3 is also 2. The sign of the dividend carries over to the remainder: (-3)%2 and (-3)%(-2) are both 1. The reason for this rule is that it guarantees that y == x*(y/x) + y%x is always true.
21.2. Bitwise operators
In addition to the arithmetic operators, integer types support bitwise logical operators that apply some Boolean operation to all the bits of their arguments in parallel. What this means is that the i-th bit of the output is equal to some operation applied to the i-th bit(s) of the input(s). The bitwise logical operators are ~ (bitwise negation: used with one argument as in ~0 for the all-1's binary value), & (bitwise AND), '|' (bitwise OR), and '^' (bitwise XOR, i.e. sum mod 2). These are mostly used for manipulating individual bits or small groups of bits inside larger words, as in the expression x & 0x0f, which strips off the bottom four bits stored in x.
Examples:
The shift operators << and >> shift the bit sequence left or right: x << y produces the value x⋅2y (ignoring overflow); this is equivalent to shifting every bit in x y positions to the left and filling in y zeros for the missing positions. In the other direction, x >> y produces the value ⌊x⋅2-y⌋, by shifting x y positions to the right. The behavior of the right shift operator depends on whether x is unsigned or signed; for unsigned values, it shifts in zeros from the left end always; for signed values, it shifts in additional copies of the leftmost bit (the sign bit). This makes x >> y have the same sign as x if x is signed.
If y is negative, it reverses the direction of the shift; so x << -2 is equivalent to x >> 2.
Examples (unsigned char x):
Examples (signed char x):
Shift operators are often used with bitwise logical operators to set or extract individual bits in an integer value. The trick is that (1 << i) contains a 1 in the i-th least significant bit and zeros everywhere else. So x & (1<<i) is nonzero if and only if x has a 1 in the i-th place. This can be used to print out an integer in binary format (which standard printf won't.
21.3. Logical operators
To add to the confusion, there are also three logical operators that work on the truth-values of integers, where 0 is defined to be false and anything else is defined by be true. These are && (logical AND), ||, (logical OR), and ! (logical NOT). The result of any of these operators is always 0 or 1 (so !!x, for example, is 0 if x is 0 and 1 if x is anything else). The && and || operators evaluate their arguments left-to-right and ignore the second argument if the first determines the answer (this is the only place in C where argument evaluation order is specified); so).
21.4. Relational operators
Logical operators usually operate on the results of relational operators or comparisons: these are == (equality), != (inequality), < (less than), > (greater than), <= (less than or equal to) and >= (greater than or equal to). So, for example,
if(size >= MIN_SIZE && size <= MAX_SIZE) { puts("just right"); }
tests if size is in the (inclusive) range [MIN_SIZE..MAX_SIZE].
Beware of confusing == with =. The code
is perfectly legal C, and will set x to 5 rather than testing if it's equal to 5. Because 5 happens to be nonzero, the body of the if statement will always be executed. This error is so common and so dangerous that gcc will warn you about any tests that look like this if you use the -Wall option. Some programmers will go so far as to write the test as 5 == x just so that if their finger slips, they will get a syntax error on 5 = x even without special compiler support.
22..4
Output is usually done using printf (or sprintf if you want to write to a string without producing output). Use the %d format specifier for ints, shorts, and chars that you want the numeric value of, %ld for longs, and %lld for long longs.
A contrived program that uses all of these features is given below: }
23..
24. C/InputOutput
Input.
25. Character streams
26. Reading and writing single characters
To read a single character from stdin, use:
27. Formatted I.:
Note the use of "%%" to print a single percent in the output.
28. Rolling your own I/O routines.
29. File I/O }
30. C/Statements
Contents.
31. Simple statements
The simplest kind of statement in C is an expression (followed by a semicolon, the terminator for all simple statements). Its value is computed and discarded. Examples:.
32. Compound statements
Compound statements come in two varieties: conditionals and loops.
32.1. Conditionals
These are compound statements that test some condition and execute one or another block depending on the outcome of the condition. The simplest is the if statement::
This style is recommended only for very simple bodies. Omitting the braces makes it harder to add more statements later without errors.:
or when a case "falls through" to the next:.
32.2. Loops
There are three kinds of loops in C.
32.2.1. The while loop
A while loop tests if a condition is true, and if so, executes its body. It then tests the condition is true again, and keeps executing the body as long as it is. Here's a program that deletes every occurence of the letter e from its input. C/Pointers.
32.2.2. The do..while loop.
32.2.3. The for loop
The for loop is a form of SyntacticSugar.
32.
32.3. Choosing where to put a loop exit.)
33. C/FloatingPoint
Real)).
34..
35..
36. |.
37..
38.).
39..
40..
41..
42..
43. C/Functions
A function, procedure, or subroutine encapsulates some complex computation as a single operation. Typically, when we call a function, we pass as arguments all the information this function needs, and any effect it has will be reflected in either its return value or (in some cases) in changes to values pointed to by the arguments. Inside the function, the arguments are copied into local variables, which can be used just like any other local variable---they can even be assigned to without affecting the original argument.
44. Function definitions
A typical function definition looks like this:
The part outside the braces is called the function declaration; the braces and their contents is the function body.
Like most complex declarations in C, once you delete the type names the declaration looks like how the function is used: the name of the function comes before the parentheses and the arguments inside. The ints scattered about specify the type of the return value of the function (Line 3) and of the parameters (Line 4); these are used by the compiler to determine how to pass values in and out of the function and (usually for more complex types, since numerical types will often convert automatically) to detect type mismatches.
If you want to define a function that doesn't return anything, declare its return type as void. You should also declare a parameter list of void if the function takes no arguments.
It is not strictly speaking an error to omit the second void here. Putting void in for the parameters tells the compiler to enforce that no arguments are passed in. If we had instead declared helloWorld as
it would be possible to call it as
without causing an error. The reason is that a function declaration with no arguments means that the function can take an unspecified number of arguments, and it's up to the user to make sure they pass in the right ones. There are good historical reasons for what may seem like obvious lack of sense in the design of the language here, and fixing this bug would break most C code written before 1989. But you shouldn't ever write a function declaration with an empty argument list, since you want the compiler to know when something goes wrong.
45. Calling a function
A function call consists of the function followed by its arguments (if any) inside parentheses, separated by comments. For a function with no arguments, call it with nothing between the parentheses. A function call that returns a value can be used in an expression just like a variable. A call to a void function can only be used as an expression by itself:
46. The return statement
To return a value from a function, write a return statement, e.g.
The argument to return can be any expression. Unlike the expression in, say, an if statement, you do not need to wrap it in parentheses. If a function is declared void, you can do a return with no expression, or just let control reach the end of the function.
Executing a return statement immediately terminates the function. This can be used like break to get out of loops early.
47. Function declarations and modules
By default, functions have global scope: they can be used anywhere in your program, even in other files. If a file doesn't contain a declaration for a function someFunc before it is used, the compiler will assume that it is declared like int someFunc() (i.e., return type int and unknown arguments). This can produce infuriating complaints later when the compiler hits the real declaration and insists that your function someFunc should be returning an int and you are a bonehead for declaring it otherwise.
The solution to such insulting compiler behavior errors is to either (a) move the function declaration before any functions that use it; or (b) put in a declaration without a body before any functions that use it, in addition to the declaration that appears in the function definition. (Note that this violates the no separate but equal rule, but the compiler should tell you when you make a mistake.) Option (b) is generally preferred, and is the only option when the function is used in a different file.
To make sure that all declarations of a function are consistent, the usual practice is to put them in an include file. For example, if distSquared is used in a lot of places, we might put it in its own file distSquared.c:
This file uses #include to include a copy of this file, distSquared.h:
Note that the declaration in distSquared.h doesn't have a body; instead, it's terminated by a semicolon like a variable declaration. It's also worth noting that we moved the documenting comment to distSquared.h: the idea is that distSquared.h is the public face of this (very small one-function) module, and so the explanation of how to use the function should be there.
The reason distSquared.c includes distSquared.h is to get the compiler to verify that the declarations in the two files match. But to use the distSquared function, we also put #include "distSquared.h" at the top of the file that uses it:
The #include on line 1 uses double quotes instead of angle brackets; this tells the compiler to look for distSquared.h in the current directory instead of the system include directory (typically /usr/include).
48. Static functions
By default, all functions are global; they can be used in any file of your program whether or not a declaration appears in a header file. To restrict access to the current file, declare a function static, like this:
The function hello will be visible everywhere. The function helloHelper will only be visible in the current file.
It's generally good practice to declare a function static unless you intend to make it available, since not doing so can cause namespace conflicts, where the presence of two functions with the same name either prevent the program from linking or---even worse---cause the wrong function to be called. The latter can happen with library functions, since C allows the programmer to override library functions by defining a new function with the same name. I once had a program fail in a spectacularly incomprehensible way because I'd written a select function without realizing that select is a core library function in C.
49. Local variables
A function may contain definitions of local variables, which are visible only inside the function and which survive only until the function returns. These may be declared at the start of any block (group of statements enclosed by braces), but it is conventional to declare all of them at the outermost block of the function.
50. Mechanics of function calls
Several things happen under the hood when a function is called. Since a function can be called from several different places, the CPU needs to store its previous state to know where to go back. It also needs to allocate space for function arguments and local variables.
Some of this information will be stored in registers, memory locations built into the CPU itself, but most will go on the stack, a region of memory that on typical machines grows downward, even though the most recent additions to the stack are called the "top" of the stack. The location of the top of the stack is stored in the CPU in a special register called the stack pointer.
So a typical function call looks like this internally:.
From the programmer's perspective, the important point is that both the arguments and the local variables inside a function are stored in freshly-allocated locations that are thrown away after the function exits. So after a function call the state of the CPU is restored to its previous state, except for the return value. Any arguments that are passed to a function are passed as copies, so changing the values of the function arguments inside the function has no effect on the caller. Any information stored in local variables is lost.
Under rare circumstances, it may be useful to have a variable local to a function that persists from one function call to the next. You can do so by declaring the variable static. For example, here is a function that counts how many times it has been called:
Static local variables are stored outside the stack with global variables, and have unbounded extent. But they are only visible inside the function that declares them. This makes them slightly less dangerous than global variables---there is no fear that some foolish bit of code elsewhere will quietly change their value---but it is still the case that they usually aren't what you want. It is also likely that operations on static variables will be slightly slower than operations on ordinary ("automatic") variables, since making them persistent means that they have to be stored in (slow) main memory instead of (fast) registers.
51. C/Pointers
Contents
- Memory and addresses
- Pointer variables
- The null pointer
- Pointers and functions
- Pointer arithmetic and arrays
- Void pointers
- Run-time storage allocation
- The restrict keyword
52. Memory and addresses.
53. Pointer variables
53.1. Declaring a pointer variable
The convention is C is that the declaration of a complex type looks like its use. To declare a pointer-valued variable, write a declaration for the thing that it points to, but include a * before the variable name:
53.2. Assigning to pointer variables:
53.3. Using a pointer
Pointer variables can be used in two ways: to get their value (a pointer), e.g. if you want to assign an address to more than one pointer variable:
But more often you will want to work on the value stored at the location pointed to. You can do this by using the * (dereference) operator, which acts as an inverse of the address-of operator:
The * operator binds very tightly, so you can usually use *p anywhere you could use the variable it points to without worrying about parentheses. However, a few operators, such as --, ++, and . (used in C/Structs) bind tighter, requiring parantheses if you want the * to take precedence.
53.4. Printing pointers
You can print a pointer value using printf with the %p format specifier. To do so, you should convert the pointer to type void * first using a cast (see below for void * pointers), although on machines that don't have different representations for different pointer types, this may not be necessary.
Here is a short program that prints out some pointer values:
1 #include <stdio.h> 2 #include <stdlib.h> 3 4 int G = 0; /* a global variable, stored in BSS segment */ 5 6 int 7 main(int argc, char **argv) 8 { 9 static int s; /* static local variable, stored in BSS segment */ 10 int a; /* automatic variable, stored on stack */ 11 int *p; /* pointer variable for malloc below */ 12 13 /* obtain a block big enough for one int from the heap */ 14 p = malloc(sizeof(int)); 15 16 printf("&G = %p\n", (void *) &G); 17 printf("&s = %p\n", (void *) &s); 18 printf("&a = %p\n", (void *) &a); 19 printf("&p = %p\n", (void *) &p); 20 printf("p = %p\n", (void *) p); 21 printf("main = %p\n", (void *) main); 22 23 free(p); 24 25 return 0; 26 } that malloc returns.
54. The null pointer.
55. Pointers and functions:
However, if instead of passing the value of y into doubler we pass a pointer to y, then the doubler function can reach out of its own stack frame to manipulate y itself::
The const qualifier tells the compiler that the target of the pointer shouldn't be modified. This will cause it to return an error if you try to assign to it anyway:
Passing const pointers is mostly used when passing large structures to functions, where copying a 32-bit pointer is cheaper than copying the thing it points to.
If you really want to modify the target anyway, C lets you "cast away const":
There is usually no good reason to do this; the one exception might be if the target of the pointer represents an AbstractDataType,:
An exception is when you can guarantee that the location pointed to will survive even after the function exits, e.g. when the location is dynamically allocated using malloc (see below) or when the local variable is declared static:.
56. Pointer arithmetic and arrays
Because pointers are just numerical values, one can do arithmetic on them. Specifically, it is permitted to
Add an integer to a pointer or subtract an integer from a pointer. The effect of p+n where p is a pointer and n is an integer is to compute the address equal to p plus n times the size of whatever p points to (this is why int * pointers and char * pointers aren't the same).
Subtract one pointer from another. The two pointers must have the same type (e.g. both int * or both char *). The result is an integer value, equal to the numerical difference between the addresses divided by the size of the objects pointed to.
Compare two pointers using ==, !=, <, >, <=, or >=.
Increment or decrement a pointer using ++ (see C/valgrind)..
56.1. Arrays and functions
Because array names act like pointers, they can be passed into functions that expect pointers as their arguments. For example, here is a function that computes the sum of all the values in an array a of size n:
Note the use of const to promise that sumArray won't modify the contents of a.
Another way to write the function header is to declare a as an array of unknown size:acticSugar for int *a. You can even modify what a points to inside sumArray by assigning to it. This will allow you to do things that you usually don't want to do, like write this hideous routine:
56.2. Multidimensional arrays
Arrays can themselves be members of arrays. The result is a multidimensional array, where a value in row i and column j is accessed by a[i][j].
Declaration is similar to one-dimensional arrays: in malloc2d.c.
56.3. Variable-length arrays:
This doesn't accompish much, because the length of the array is not used. However, it does become useful if we have a two-dimensional array, as otherwise there is no way to compute the length of each row::
1 /* reverse an array in place */ 2 void 3 reverseArray(int n, int a[n]) 4 { 5 /* algorithm: copy to a new array in reverse order */ 6 /* then copy back */ 7 8 int i; 9 int copy[n]; 10 11 for(i = 0; i < n; i++) { 12 /* the -1 is needed to that a[0] goes to a[n-1] etc. */ 13 copy[n-i-1] = a[i]; 14 } 15 16 for(i = 0; i < n; i++) { 17 a[i] = copy[i]; 18 } 19 }.
1 /* reverse an array in place */ 2 void 3 reverseArray(int n, int a[n]) 4 { 5 /* algorithm: copy to a new array in reverse order */ 6 /* then copy back */ 7 8 int i; 9 int *copy; 10 11 copy = (int *) malloc(n * sizeof(int)); 12 assert(copy); /* or some other error check */ 13 14 for(i = 0; i < n; i++) { 15 /* the -1 is needed to that a[0] goes to a[n-1] etc. */ 16 copy[n-i-1] = a[i]; 17 } 18 19 for(i = 0; i < n; i++) { 20 a[i] = copy[i]; 21 } 22 23 free(copy); 24 }
57. Void pointers
A special pointer type is void *, a "pointer to void". Such pointers are declared in the usual way:
Unlike ordinary pointers, you can't derefence.
If you need to use a void * pointer as a pointer of a particular type in an expression, you can cast it to the appropriate type by prefixing it with a type name in parentheses, like this:.
58. Run-time storage allocation
C does not:
When you are done with a malloc'd region,.
It is a serious error to do anything at all with a block after it has been freed.
It is also possible to grow or shrink a previously allocated block. This is done using the realloc function, which is declared as:
1 /* read numbers from stdin until there aren't any more */ 2 /* returns an array of all numbers read, or null on error */ 3 /* returns the count of numbers read in *count */ 4 int * 5 readNumbers(int *count /* RETVAL */) 6 { 7 int mycount; /* number of numbers read */ 8 int size; /* size of block allocated so far */ 9 int *a; /* block */ 10 int n; /* number read */ 11 12 mycount = 0; 13 size = 1; 14 15 a = malloc(sizeof(int) * size); /* allocating zero bytes is tricky */ 16 if(a == 0) return 0; 17 18 while(scanf("%d", &n) == 1) { 19 /* is there room? */ 20 while(mycount >= size) { 21 /* double the size to avoid calling realloc for every number read */ 22 size *= 2; 23 a = realloc(a, sizeof(int) * size); 24 if(a == 0) return 0; 25 } 26 27 /* put the new number in */ 28 a[mycount++] = n; 29 } 30 31 /* now trim off any excess space */ 32 a = realloc(a, sizeof(int) * mycount); 33 /* note: if a == 0 at this point we'll just return it anyway */ 34 35 /* save out mycount */ 36 *count = mycount; 37 38 return a; 39 }
Because errors involving malloc and its friends can be very difficult to spot, it is recommended to test any program that uses malloc using valgrind if possible. (See C/valgrind).
(See also C/DynamicStorageAllocation for some old notes on this subject.)
59. The restrict keyword, in the short routine:
the output of gcc -std=c99 -O3 -S includes one more instruction if the restrict qualifiers are removed. The reason is that if dst and src may point to the same location, src needs to be re-read for the return statement, in case it changed, but if they don't,.
60. C/Strings
61. String processing in general:
As a delimited string, where the end of a string is marked by a special character. The advantages of this method are that only one extra byte is needed to indicate the length of an arbitrarily long string, that strings can be manipulated by simple pointer operations, and in some cases that common string operations that involve processing the entire string can be performed very quickly. The disadvantage is that the delimiter can't appear inside any string, which limits what kind of data you can store in a string.
As a counted string, where the string data is prefixed or supplemented with an explicit count of the number of characters in the string. The advantage of this representation is that a string can hold arbitrary data (including delimiter characters) and that one can quickly jump to the end of the string without having to scan its entire length. The disadvantage is that maintaining a separate count typically requires more space than adding a one-byte delimiter (unless you limit your string length to 255 characters) and that more care needs to be taken to make sure that the count is correct.
62. C strings
Because delimited strings are more lightweight, C went for delimited strings. A string is a sequence of characters terminated by a null character '\0'. (see C/Structs). Most scripting languages written in C (e.g. Perl, Python_programming_language, PHP, etc.) use this approach internally. (Tcl is an exception, which is one of many good reasons not to use Tcl).
63. String constants used in normal code much, but shows up sometimes in macros (see C/Macros).
64. String buffers).
65. Operations on strings.
1 void 2 strcpy2(char *dest, const char *src) 3 { 4 /* This line copies characters one at a time from *src to *dest. */ 5 /* The postincrements increment the pointers (++ binds tighter than *) */ 6 /* to get to the next locations on the next iteration through the loop. */ 7 /* The loop terminates when *src == '\0' == 0. */ 8 /* There is no loop body because there is nothing to do there. */ 9 while(*dest++ = *src++); 10 } programming
1 /* copy the substring of src consisting of characters at positions 2 start..end-1 (inclusive) into dest */ 3 /* If end-1 is past the end of src, copies only as many characters as 4 available. */ 5 /* If start is past the end of src, the results are unpredictable. */ 6 /* Returns a pointer to dest */ 7 char * 8 copySubstring(char *dest, const char *src, int start, int end) 9 { 10 /* copy the substring */ 11 strncpy(dest, src + start, end - start); 12 13 /* add null since strncpy probably didn't */ 14 dest[end - start] = '\0'; 15 16 return dest; 17 }.
66. Finding the length of a string
Because the length of a string is of fundamental importance in C (e.g., when deciding if you can safely copy it somewhere else), the standard C library provides a function strlen that counts the number of non-null characters in a string. Here's a possible implementation:.
66.1. The strlen tarpit
A common mistake is to put a call to strlen in the header of a loop; for example:
1 /* like strcpy, but only copies characters at indices 0, 2, 4, ... 2 from src to dest */ 3 char * 4 copyEvenCharactersBadVersion(char *dest, const char *src) 5 { 6 int i; 7 int j; 8 9 /* BAD: Calls strlen on every pass through the loop */ 10 for(i = 0, j = 0; i < strlen(src); i += 2, j++) { 11 dest[j] = src[i]; 12 } 13 14 dest[j] = '\0'; 15 16 return dest; 17 }:
1 /* like strcpy, but only copies characters at indices 0, 2, 4, ... 2 from src to dest */ 3 char * 4 copyEvenCharacters(char *dest, const char *src) 5 { 6 int i; 7 int j; 8 int len; /* length of src */ 9 10 len = strlen(src); 11 12 /* GOOD: uses cached value of strlen(src) */ 13 for(i = 0, j = 0; i < len; i += 2, j++) { 14 dest[j] = src[i]; 15 } 16 17 dest[j] = '\0'; 18 19 return dest; 20 }
Because it doesn't call strlen all the time, this version of copyEvenCharacters will run much faster than the original even on small strings, and several million times faster if src is a megabyte long.
67. Comparing strings possible but slow implementation might look like this:
(The reason this implementation is slow on modern hardware is that it only compares the strings one character at a time; it is almost always faster to compare four characters at once on a 32-bit architecture, although doing so requires no end of trickiness to detect the end of the strings. It is also likely that whatever C library you are using contains even faster hand-coded assembly language versions of strcmp and the other string routines for most of the CPU architectures you are likely to use. Under some circumstances, the compiler when running with the optimizer turned on may even omit a function call entirely and just patch the appropriate assembly-language code directly into whatever routine calls strcmp, strlen etc. As a programmer, you should not be able to detect that any of these optimizations are happening, but they are another reason to use standard C language or library features when you can.)
To use strcmp to test equality, test if the return value is 0:
You may sometimes see this idiom instead:
My own feeling is that the first version is more clear, since !strcmp always suggested to me that you were testing for not some property (e.g. not equal). But if you think of strcmp as telling you when two strings are different rather than when they are equal, this may not be so confusing.
68. Formatted output to strings.
69. Dynamic allocation of strings
When allocating space for a copy of a string s using malloc, the required space is strlen(s)+1. Don't forget the +1, or bad things may happen.5 Because allocating space for a copy of a string is such a common operation, many C libraries provide a strdup function that does exactly this. If you don't have one (it's not required by the C standard), you can write your own like this:
Exercise: Write a function strcat_alloc that returns a freshly-malloc'd string that concatenates its two arguments. Exactly how many bytes do you need to allocate?
70. argc and argv
Now that we know about strings, we can finally do something]6:
Like strings, C terminates argv with a null: the value of argv[argc] is always 0 (a null pointer to char). In principle this allows you to recover argc if you lose it.
71. C/Structs
72. Structs
A struct is a way to define a type that consists of one or more other types pasted together. Here's a typical struct definition::
Variables of type struct can be assigned to, passed into functions, returned from functions, and tested for equality, just like any other type. Each such operation is applied componentwise; for example, s1 = s2; is equivalent to s1.length = s2.length; s1.data = s2.data; and.7 Suppose we have:
`
We can then refer to elements of the struct string that sp points to (i.e. s) in either of two ways:DataTypes,:
1 /* make a struct string * that holds a copy of s */ 2 struct string *makeString(const char *s); 3 4 /* destroy a struct string * */ 5 void destroyString(struct string *); 6 7 /* return the length of a struct string * */ 8 int stringLength(struct string *); 9 10 /* return the character at position index in the struct string * */ 11 /* or returns -1 if index is out of bounds */ 12 int stringCharAt(struct string *s, int index);
and then the actual implementation in myString.c would be the only place where the components of a struct string were defined:
1 #include <stdlib.h> 2 #include <string.h> 3 4 #include "myString.h" 5 6 struct string { 7 int length; 8 char *data; 9 }; 10 11 struct string * 12 makeString(const char *s) 13 { 14 struct string *s2; 15 16 s2 = malloc(sizeof(struct string)); 17 if(s2 == 0) return 0; 18 19 s2->length = strlen(s); 20 21 s2->data = malloc(s2->length); 22 if(s2->data == 0) { 23 free(s2); 24 return 0; 25 } 26 27 strncpy(s2->data, s, s2->length); 28 29 return s2; 30 } 31 32 void 33 destroyString(struct string *s) 34 { 35 free(s->data); 36 free(s); 37 } 38 39 int 40 stringLength(struct string *s) 41 { 42 return s->length; 43 } 44 45 int 46 stringCharAt(struct string *s, int index) 47 { 48 if(index < 0 || index >= s->length) { 49 return -1; 50 } else { 51 return s->data[index]; 52 } 53 }
In practice, we would probably go even further and replace all the struct string * types with a new name declared with typedef.
73. Unions:
Now if you wanted to make a struct lispObject that held an integer value, you might write
where TYPE_INT had presumably been defined somewhere. Note that nothing then prevents you from writing
but the effects.
74. Bit fields
It is possible to specify the exact number of bits taken up by a member of a struct of integer type. This is seldom useful, but may in principle let you pack more information in less space, e.g.:
defines a struct that (probably) occupies only one byte, and supplies four 2-bit fields, each of which can hold values in the range 0-3.
75. AbstractDataTypes
76. Abstraction.
77. Example of an abstract data.
77.1. Interface:
77.1.1..
77.2. Implementation
The implementation of an ADT in C is typically contained in one (or sometimes more than one) .c file. This file can be compiled and linked into any program that needs to use the ADT. Here is our implementation of Sequence:
77.2.1..
77.3. Compiling and linking
Now that we have sequence.h and sequence.c, how do we use them? Let's suppose we have a simple main program:
77.3.1.:
77.3.2.
78. Designing abstract data types
Now we've seen how to implement an abstract data type. How do we choose when to use when, and what operations to give it? Let's try answering the second question first.
78.1..
78.2. When to build an abstract data type:
- A list of students,
- A student,
- A list of grades,
- A grade..
79. C/Definitions
One.
80..
81..
82..
83. Other uses of #define
It is also possible to use #define to define preprocessor macros that take parameters; this will be discussed in C/Macros.
84. C/Debugging
Contents
85. Debugging in general
Basic method of all debugging:
- Know what your program is supposed to do.
- Detect when it doesn't.
- Fix it..
86. Assertions
Every non-trivial C program should include <assert.h>, which gives you the assert macro (see KernighanRitchie Appendix B6). The assert macro tests if a condition is true and halts your program with an error message if it isn't:
no.cno.c
$.
87. gdb
The standard debugger on Linux is called gdb. This lets you run your program under remote control, so that you can stop it and see what is going on inside.
Let's look at a contrived example. Suppose you have the following program bogus.c:
Let's compile and run it and see what happens:
$ gcc Starting program: .
87.1. My favorite gdb commands
- Get a description of gdb's commands.
- run
- Runs your program. You can give it arguments that get passed in to your program just as if you had typed them to the shell. Also used to restart your program from the beginning if it is already running.
- quit
- Leave gdb, killing your program if necessary.
- break
- Set a breakpoint, which is a place where gdb will automatically stop your program. Some examples:
break somefunction stops before executing the first line somefunction.
break 117 stops before executing line number 117.
- list
- Show part of your source file with line numbers (handy for figuring out where to put breakpoints). Examples:
list somefunc lists all lines of somefunc.
list 117-123 lists lines 117 through 123.
- Execute the next line of the program, including completing any procedure calls in that line.
- step
- Execute the next step of the program, which is either the next line if it contains no procedure calls, or the entry into the called procedure.
- finish
- Continue until you get out of the current procedure (or hit a breakpoint). Useful for getting out of something you stepped into that you didn't want to step into.
- cont
(Or continue). Continue until (a) the end of the program, (b) a fatal error like a Segmentation Fault or Bus Error, or (c) a breakpoint. If you give it a numeric argument (e.g., cont 1000) it will skip over that many breakpoints before stopping. | http://www.cs.yale.edu/homes/aspnes/pinewiki/CS223(2f)AllNotes.html | CC-MAIN-2017-51 | refinedweb | 9,736 | 60.14 |
are split into Forms. You can include one Form inside another, and use Links to switch between them.
Our Material Design theme has a sidebar for navigation. Drop Links into it and configure their
click handlers to add an instance of the desired Form to the main Form’s
content_panel:
from Page1 import Page1 # ... def link_1_click(self, **event_args): """This method is called when the link is clicked""" self.content_panel.clear() self.content_panel.add_component(Page1())
This is an example app showing navigation between pages using the sidebar.
Click here to clone the example app in the Anvil designer.
Here is a video tutorial showing step-by-step how to set up navigation Links.
For detailed information, see the Navigation section of the reference docs..
We will create a custom Theme for you if you are a Business Plan customer. Contact us at support@anvil.works to discuss further. | https://anvil.works/kb/navigate-between-pages.html | CC-MAIN-2019-22 | refinedweb | 147 | 60.01 |
Serving Static Assets¶
This collection of recipes describes how to serve static assets in a variety of manners.
Serving File Content Dynamically¶
Usually you'll use a static view (via "config.add_static_view") to serve file content that lives on the filesystem. But sometimes files need to be composed and read from a nonstatic area, or composed on the fly by view code and served out (for example, a view callable might construct and return a PDF file or an image).
By way of example, here's a Pyramid application which serves a single static
file (a jpeg) when the URL
/test.jpg is executed:
from pyramid.view import view_config from pyramid.config import Configurator from pyramid.response import FileResponse from paste.httpserver import serve @view_config(route_name='jpg') def test_page(request): response = FileResponse( '/home/chrism/groundhog1.jpg', request=request, content_type='image/jpeg' ) return response if __name__ == '__main__': config = Configurator() config.add_route('jpg', '/test.jpg') config.scan('__main__') serve(config.make_wsgi_app())
Basically, use a
pyramid.response.FileResponse as the response object and
return it. Note that the
request and
content_type arguments are
optional. If
request is not supplied, any
wsgi.file_wrapper
optimization supplied by your WSGI server will not be used when serving the
file. If
content_type is not supplied, it will be guessed using the
mimetypes module (which uses the file extension); if it cannot be guessed
successfully, the
application/octet-stream content type will be used.
Serving a Single File from the Root¶
If you need to serve a single file such as
/robots.txt or
/favicon.ico that must be served from the root, you cannot use a
static view to do it, as static views cannot serve files from the
root (a static view must have a nonempty prefix such as
/static). To
work around this limitation, create views "by hand" that serve up the raw
file data. Below is an example of creating two views: one serves up a
/favicon.ico, the other serves up
/robots.txt.
At startup time, both files are read into memory from files on disk using plain Python. A Response object is created for each. This response is served by a view which hooks up the static file's URL.
Root-Relative Custom Static View (URL Dispatch Only)¶
The
pyramid.static.static_view helper class generates a Pyramid view
callable. This view callable can serve static assets from a directory. An
instance of this class is actually used by the
pyramid.config.Configurator
pyramid.static.static_view cannot be made root-relative when you
use traversal.
To serve files within a directory located on your filesystem at
/path/to/static/dir as the result of a "catchall" route hanging from the
root that exists at the end of your routing table, create an instance of the
pyramid.static.static_view class inside a
static.py file in your
application root as below:
from pyramid.static import static_view www = static_view('/path/to/static/dir', use_subpath=True)
Note
For better cross-system flexibility, use an asset
specification as the argument to
pyramid.static.static_view
instead of a physical absolute filesystem path, e.g.
mypackage:static
instead of
/path/to/mypackage/static.
Subsequently, you may wire the files that are served by this view up to be
accessible as
/<filename> using a configuration method in your
application's startup code:
# .. every other add_route and/or add_handler declaration should come # before this one, as it will, by default, catch all requests config.add_route('catchall_static', '/*subpath', 'myapp.static.www')
The special name
*subpath above is used by the
pyramid.static.static_view view callable to signify the path of the
file relative to the directory you're serving. | https://docs.pylonsproject.org/projects/pyramid_cookbook/en/latest/static_assets/serving-files.html | CC-MAIN-2019-26 | refinedweb | 607 | 50.02 |
Hi,
I know this question have been asked multiple times, but none of the mentioned answers were "satisfactory".
I managed to get a list of genes for each KEGG pathway using the kg tool (). However, when I try to convert this list to other identifier type, a big problem arise.
Since I want an automatic way and from the suggestions in the mentioned question, I decided to use the python wrapper of MyGene.info
import mygene mg = mygene.MyGeneInfo() allGeneSymbols = ["DP2", "DP1", "MAD3L"] out = mg.querymany(allGeneSymbols, scopes='symbol', fields='entrezgene', species='human')
It worked only for a small set of genes and the problem seems to be the naming. For example, one of the genes where no conversion can be achieved is called DP2 in the KEGG list. However, when I dig a bit more, I was able to find this gene within the MyGene.info using and it is named "TFDP2"
{"hits": [{"symbol": "PTGDR2", "_id": "11251", "entrezgene": 11251, "_score": 0.7157431, "name": "prostaglandin D2 receptor 2", "taxid": 9606}, {"symbol": "TFDP2", "_id": "7029", "entrezgene": 7029, "_score": 0.6262752, "name": "transcription factor Dp-2 (E2F dimerization partner 2)", "taxid": 9606}, {"symbol": "APC", "_id": "324", "entrezgene": 324, "_score": 0.58416, "name": "adenomatous polyposis coli", "taxid": 9606}], "max_score": 0.7157431, "took": 4, "total": 3}
which shows why it has not been found using the python script!!!
any suggestions on a better way to handle such a problem? I mean one option would be to get the JSON output with curl and do something with it (not the best way). Another option would be to use Reactome, but this would require re-writing everything to deal with the reactome hierarchy and get the genes and so on (unless some tool already exist to do this).
EDIT:
One more way that I found where one could get all the KEGG genes (Entrez ID) is downloading the data from GSEA (e.g.,). However, building the KEGG hierarchy from this file is simply not possible which does not solve my problem.
Does this mean that the you were not able to convert all the gene names from kegg even using mygene.info? (I am currently investigating the same problem, but have found no satisfactory solutions.)
exactly. I could not convert all the kegg genes even using mygene.info. I showed an example where I know why the conversion did not work. | https://www.biostars.org/p/164441/ | CC-MAIN-2020-10 | refinedweb | 395 | 71.75 |
Qt aims at being fully internationalized by use of its own i18n framework [qt-project.org].creator [kde.org] already has a translation of Qt to your language and whether they would be willing (and legally able) to contribute it to Qt upstream. Even if not, somebody from the community [i18n.kde.org].
First, you need translation templates to work with. Qt uses its own TS (translation source) XML file format for that.
There are several ways to get them:
$PATHstarts with
$qt5/qtbase/bin
$qt5/qttranslations/translations
perl split-qt-ts.pl <lang>
make ts-<lang>in the
$qt5/qttranslations/translationssubdirectory, where
<lang>is the language (and optionally country) code.
make ts-<part>-<lang>to update only a specific file.
make ts-<part>-untranslated(or
make ts-untranslatedto get all) and rename the file(s) accordingly. Do not qualify the language with a country unless it is reasonable to expect country-specific variants. You will also need to add the files to translations/translations.pro.> to dispose of the old strings.
Next, you need to commit any PRI/PRO files you modified and the TS file(s) you translated. If you added new files, first run
git add -N <files> (the -N is important!). Then run
make commit-ts to check in the files (you should have no other modified files due to the use of language-specific ts targets). The commit-ts target will also strip out line number information from the TS files to keep the changes smaller.
Finally, you need to post a change on Gerrit for review.
The instructions are identical to the ones for Qt, except that the translations and various ts- targets live in
share/qtcreator/translations.
Qt Creator will not use the translation unless it finds one for the Qt library as well. Qt Designer, Qt Assistant and the Qt Help library should be translated as well, though failure to do so will go unnoticed at first.
The infrastructure for that is somewhat lacking. Still, there is for example the simplified Chinese doc translation. OSX, unless we begin to support touchscreens. But OSX does not have multi-touch touchscreen support anyway, AFAIK.
Touchscreens are commonplace, and we should try to have feature parity with the other touch platforms.
There is also a complete listing of all pages..]]>
Qt 5.4.0 was released on 10th of Dec 2014.
The following pages has more information:
New Features in Qt 5.4
Qt 5.4 Tools & Versions [qt-project.org]
Issues to be fixed before Beta:
Issues to be fixed before RC:
Issues to be fixed before final:]
Release team meeting 20.10.2014 [lists.qt-project.org]
Release team meeting 10.11.2014 [lists.qt-project.org]
Release team meeting 17.11.2014 [lists.qt-project.org]
Release team meeting 24.11.2014 [lists.qt-project.org]
Release team meeting 08.12.2014 [lists.qt-project.org]
For almost every finished Qt project it is wanted and in most cases also required to carry extern resources.
When porting the executable to other users on other computers that usually don’t have Qt installed, it is necessary to port the needed Qt libraries, too.
Also, it is often necessary to include sound files, pictures, text files and other stuff to the executable.
One common way is to pack all that stuff into a zip archive and hope that the target user will manage things correctly.
Another, more complicated and maybe not in every case usable way would be to use the Qt resource management.
For those of you who would like to handle import/export of every kind of resource very easily, I wrote a little “ResourceManager”.
The obligatory algorithms are stored in two files:
1. resourcemanager.h
2. resourcemanager.cpp
For easy creating a setup file by mouse clicking, I also wrote a user interface. This interface additionally requires the following six files:
1. mainwindow.h
2. mainwindow.cpp
3. myQDialogGetFile.h
4. myQDialogGetFile.cpp
5. myQDialogGetNewFile.h
6. myQDialogGetNewFile.cpp
For basic usage of the ResourceManager, you have to create a new project (this will be the executable that will import the resources to your setup) and add the two obligatory files (resourcemanager.h, resourcemanager.cpp).
In the main source file, you only have to specify the resources and pass them to the resourcemanager algorithm.
There are two functions that can be used, depending on how the resources shall be passed:
a) as a QStringList:
b) from an existing resource table file (ini format):
ResourceTable.ini:
I strongly recommend not to call the resourcemanager algorithms manually, because there are lots of mistakes that can happen like typing a wrong resource path, using forbidden characters (e.g.g backslash) and so on.
It is advisable to use the user interface instead.
For using the interface, you only have to create a new project and import all files given above (resourcemanager.h/.cpp, mainwindow.h/.cpp, myQDialogGetFile.h/.cpp, myQDialogGetNewFile.h/.cpp), compile and run it.
After the mainwindow is shown, you can select new resources from your computer and add them to the resource table, or you can load an already existing resource table (ini file). By clicking the button “import to library” you can import all files from the table to your specified setup file.
You can also save the chosen resources as a new resource table file for later use.
The only thing you have to modify in your setup file project is to add the two resourcemanager files (resourcemanager.h/.cpp) and place the following command into the main function (or anywhere else at the point of execution where resources should be exported):
I would really appreciate it to get some feedback from you, so I can improve my own skills and make the algorithms better.
Thank you in anticipation!]]>
Usually applications have a Quit action in the context menu,
The following code will show a question dialog to the user to make sure that (s)he really wants to quit.
There is also an option to supress this message.
To reenable this message you will need to clear the mainwindow/quitWithoutPrompt key trough the default QSettings. The following code can be used do do that:.
The latest version of PySide is 1.2.2 released on April 25, 2014 and provides access to the complete Qt 4.8 framework.
This Wiki is a community area where you can easily contribute, and which may contain rapidly changing information. Please put any wiki pages related to PySide into the the PySide category by adding the following text to the top of the page:
Also, since PySide is sharing the wiki with other Qt users, include the word “PySide” or “Python” in the names of any new pages you create to differentiate it from other Qt pages..]]>
The API Extractor was a library used by the binding generator component (Shiboken) to parse headers of a given library and merge this data with information provided by typesystem (XML) files, resulting in a representation of how the API should be exported to the chosen target language. The generation of source code for the bindings was performed by specific generators that were using the API Extractor library.
In PySide 1.1.1 [pypi.python.org] API Extractor was merged into Shiboken, but docs on it are still available.
The API Extractor is based on QtScriptGenerator [labs.trolltech.com] code.
Linking of position based applications fails due to an incorrect CLASS_NAME. For more details and a temporary workaround see QTBUG-39843. The fix can be tracked via ..
Note: If you built qt5 from the git repository and you get an error like
..then In your qt5 repository run:.]]>
Currently, Qt5 is neither included in the BlackBerry 10 device software nor in the BlackBerry 10 SDK. However, Qt5 on BlackBerry 10 has reached a excellent level of quality and can be used for developing and publishing applications to BlackBerry World [appworld.BlackBerry.com].
There are currently two options how you can use Qt5 on BlackBerry 10:
See sections below for more details.
The Qt team in BlackBerry started to provide pre-built Qt5 as a Qt Project delivery. Packages are available
here[Broken Link] [qtlab.blackberry.com]. The purpose of the overlay is to support Qt5 enthusiasts and save their time from building Qt5 from scratch. Most importantly, we would also like to get feedback from a broader community which will help to improve Qt5 on BlackBerry 10 in the future.
Please go through the
README[Broken Link] [qtlab.blackberry.com] to learn how to install and use the packages. The provided packages require the 10.2 Gold [developer.blackberry.com] version of the BlackBerry 10 Native SDK. After the installation, Qt5 is automatically recognized and configured in Qt Creator 3.0 (and later), is available on command line, and can be immediately used for application development. Even though you do not need an own build, you still need to pay attention to a few details described on this page.
Please provide your feedback! This helps making it better! Please use the QtPorts: BB10 [bugreports.qt-project.org] component for BlackBerry 10 specific issues and other components for Qt generic issues even if you found them on BlackBerry 10. Consider visiting:
Note: The overlay packages are not a part of the official NDK distributions by BlackBerry, but an add-on provided by the Qt Project. Be aware that you cannot mix Qt5 code with Cascades application framework APIs based on Qt 4.8. The Momentics IDE currently does not support Qt5 development.
This is an option for advanced developers and Qt contributors. Most application developer will probably prefer not investing time in this.
Please take a look on this page to get an overview of the status of Qt5 on BlackBerry 10.]]>
See “Qt for Android known issues“
See “Qt for iOS known issues“
See “Qt5 Status on BlackBerry 10“
See “Qt Status on QNX“
Authors: Jaroslaw Staniek [qt-project.org] (staniek at kde.org), Tomasz Olszak [qt-project.org] . Feedback welcome!
This HOWTO explains full process of installation and configuration Qt SDK for Tizen, needed for developing software with Qt for Tizen smartphone (developer device RD-PQ [wiki.tizen.org] and emulator), Tizen NUC [intel.com] which is reference device for Tizen Common profile and Tizen IVI devices. This process applies to Qt for Tizen Alpha 7 and has been tested with Ubuntu 14.04 64bit. Other versions have not been tested (feedback is welcome). Version of Tizen SDK is 2.2.1. Version of Qt
While the process has been highly automatized, it consists of several steps.
Following steps describe creating Tizen Common cross compilation tools. But you can also use the same steps for IVI (just change profile parameter passed to prepare_developer_tools script)
Download official Qt installer suitable for your architecture. 5.4.0 version is placed in following remote directory:
Make the binary executable (chmod u+x qt-opensource-linux-[x86|x64]-5.4.0.run), and install it in location writable by current user (write access is needed for tizen Qt Creator plugin)
Be sure that you have bash as your shell. By default Ubuntu has dash. To change the shell to bash invoke:
Use command line for most of steps explained here. Install development tools (such as gbs) as specified at [source.tizen.org]. Please note version of the distribution should be correctly specified when adding repository, so for Ubuntu 13.04:
In /etc/apt/sources.list.d/tizen.list add the folowing line to add repository (please note space before “/”):
All most recent Ubuntu and debian) versions are supported. See
Then:
and:
this will show:
Answer “y” here.
This can show:
Answer “y” here again.
Clone the tizenbuildtools git repository:
Even while Qt developers prefer using Qt Creator (or their beloved text editor plus command line) over Tizen SDK’s Eclipse-based Integrated development environment, at least two tools are still needed:
These tools are bundled and distributed in a single Tizen SDK so it should be installed first. To do so, perform following steps:
About 5 GB of free disk space is needed for these steps.
Result: You should be able to:
If you want to develop for mobile profile (Tizen Mobile device or emulator) you need to add author certificate. The certificate generator tool is a cross-platform command line tool used to generate developer private keys and certificates from their intermediate CA certificates. The private keys and certificates are used for signing and verifying Tizen applications. To create and register certificate in the Tizen IDE as explained here [developer.tizen.org].
After installing Qt SDK [qt-project.org] (by default to $HOME/Qt5.4.0 directory), follow the README file placed in tizenbuildtools/README. After that start Qt Creator. The Tizen plugin should be available.
Follow this steps to build,. deploy, debug and run Qt applications on Tizen Common or Tizen IVI (or other Tizen profiles where ssh server is available on device)
By default “app” user (used for development) doesn’t have a password, so if you want to connect using ssh you need to set password:
All configuration steps listed below should be performed and in specified order.
Compared to Qt 4, Qt 5 is highly modularized. Different Git repositories [qt.gitorious.org] hold the different Qt modules that developers can use in their applications. Some of these modules also encapsulate typedefs, enums, flags, or standalone functions within namespaces.
The diagram below shows all Git repositories and modules that are part of the Qt 5.4 library.
]]>]]>).
Qt supports many different platforms and operating systems. The people in this list have the final responsibility for Qt on a certain platform/operating system.. I’d venture to say that they’re at least a lot easier to use and handle than sockets :) [qt-project.org], compares the different approaches.
The rest of this article demonstrates one of these methods: QThread + a worker QObject. This method is intended for use cases which involve event-driven programming and signals + slots across threads.
The main thing..
(taken from [mayaposch.wordpress.com])
qtactiveqt:
qtandroidextras:
qtbase:
qtconnectivity:
qtdeclarative:
qtdoc:
qtenginio:
qtquickcontrols:
qtimageformats:
qtlocation:
qtmultimedia:
qtsensors:
qtserialport:
qtwebkit:
qtwinextras:
A full guide on Qt for Python – PySide and PyQt. With PySide and PyQt Python code examples, tutorials and references. Authored by Jason Fruit who has worked with Python since 2000. In fact, he loves it so much, he even used it to name his children.
This page lists Android devices we already have available for testing as well as devices it would be nice to get.
Sorted by priority. What matters here is the SoC manufacturer, the CPU architecture, and the GPU model, devices are provided as an example. If a specific one cannot be found, we can get another one with the same SoC. All of them have at least Android 4.0 to be able to test as many things as possible.]]>
The Qt 5 for Android project is based on Necessitas [necessitas.kde.org] , the port of Qt 4 to Android. This is an overview page to organize the development of the port.
The Qt 5 for Android is already released in Qt 5 and instructions on how to obtain the necessary packages as well as view documentation and run examples, visit the Qt 5 documentation page Qt 5 Documentation [qt-project.org]
Qt 5 for Android consists of several parts:
1. A platform plugin in $QTDIR/src/plugins/platforms/android
2. Java code which is built into a distributable .jar file containing binding code in $QTDIR/src/android/jar
3. Java code which is used as a template for new projects by the Qt Creator plugin in $QTDIR/src/android/java
4. A mkspec in $QTDIR/mkspecs/android-g++
5. Some build files in $QTDIR/android
6. A plugin to Qt Creator which generates the necessary Java wrapper, manifests, build instructions, etc to develop and deploy on Android. This is in $QTCREATOR/src/plugins/android.
If you have questions or suggestions to anyone working on this project, the easiest would be contact us on IRC. We are on #necessitas on the Freenode IRC servers.
We also have the project mailing list:
The project is currently in the regular Qt repositories in codereview.qt-project.org. Clone the repositories and check out the “dev” branch to try it out.
For the first experimental release of Qt 5 for Android, we aim to have support for the modules in qtbase.git, qtdeclarative.git, Qt Sensors and Qt Multimedia. Here is the current status of the modules.
Status of qtbase.git (Qt Core, Qt GUI, Qt Network, Qt SQL, Qt Test, Qt Widgets, Qt Concurrent, Qt D-Bus, Qt OpenGL, Qt Print Support, Qt XML)
Status of qtdeclarative.git (Qt QML, Qt Quick)
Status of Qt Sensors
Status of Qt Multimedia
We are compiling a list of devices where Qt for Android has been tested. If you are testing on a device which is not yet in the list (or if you have additional information), please update the page to include your experiences. There is also a list of test devices in the Oslo office.
We are currently running autotests manually on devices to monitor progress. Automation is under investigation as well. Take a look at the current results.
Remaining issues for Qt for Android [bugreports.qt-project.org]
Remaining issues for Android plugin in Qt Creator [bugreports.qt-project.org]
These are used to monitor the progress of the project. Bugs and missing features can be filed in https//bugreports.qt-project.org by setting component “QtPorts: Android” and “Android Support” in Qt and Qt Creator products respectively.]]>
Montage du système de fichier distant (sshfs):
mkdir /mnt/a20/
apt-get install -f sshfs autoconf libtool
sshfs -o allow_other root@[targetAdress]:/ /mnt/a20/
git clone git://gitorious.org/cross-compile-tools/cross-compile-tools.git
cd cross-compile-tools
./fixQualifiedLibraryPaths /mnt/a20/ /usr/bin/arm-linux-gnueabihf-g++
cd ..
qeglfshooks_stub.cpp : wget
qmake.conf : wget
tar xvzf ressources/qt-everywhere-opensource-src-5.3.2.tar.gz
cd qt-everywhere-opensource-src-5.3.1 cp -rfv qtbase/mkspecs/devices/linux-beagleboard-g++ qtbase/mkspecs/devices/linux-a20olimex-g++ rm qtbase/mkspecs/devices/linux-a20olimex-g++/qmake.conf
cd ..
cp qmake.conf qt-everywhere-opensource-src-5.3.1/qtbase/mkspecs/devices/linux-a20olimex-g++/
cp qeglfshooks_stub.cpp qt-everywhere-opensource-src-5.3.1/qtbase/src/plugins/platforms/eglfs/
./configure
opengl es2 -device linux-a20olimex-g++ -device-option CROSS_COMPILE=/usr/bin/arm-linux-gnueabihf -sysroot /mnt/a20 -opensource -confirm-license -optimized-qmake -release -make libs -prefix /usr/local/qt5a20 -no-pch -nomake tests -no-xcb -eglfs -v -skip qtwebkit-examples -skip qtwebkit -tslib && cat qtbase/config.summary
make -j5
make install]]>
Qt uses manual reference counting, ARC usage is currently prohibited.
Rationale: ARC requires a 64-bit build. There is little benefit of using ARC for the 64-bit builds only since we still have to maintain the manual reference counting code paths. ARC can be used when Qt no longer support 32-bit builds.
Qt does not patch or polyfill the Cocoa runtime using class_addMethod(). [There are some instances of this in Qt 5.3, but we do not want to expand the usage.]
Rationale: Using this technique to work around OS version differences would be convenient. However, as a library we want to be conservative and don’t change the runtime. We also don’t want to introduce another abstraction layer in addition to the version abstraction patterns already in Qt.
Use that instead of calling getters and setters. Cocoa and UIKit are doing the same. Use them in Qt’s own Objective C classes as well. (We need to check which compiler versions, that we support, still need the @synthesize directive + ivar declaration. Ideally, we should move away from that too).
Rationale: This is how Objective C works nowadays. It also adds the possibility of adding properties to classes through categories. Finally, it will ease the transition to ARC when 32-bit support is finally dropped.
We want Qt to work on new OS versions, including pre-releases. As platform developers we are not concerned about “official” support in the project, but would rather see Qt work right away. The main restriction is practical difficulties related to developing and testing on pre-release OS versions.
Dropping support for old versions is done on a semi-regular basis. Inputs are
There process of dropping support is gradual:
Gradual loss of quality is not a goal.
QWebKit/WebEngine lives its own life depending on upstream support
We would like to move to a “the only version is the current version” world. (This is currently more true on iOS than OS X.)
In general, if we support a given OS X version as a development platform then we support the most recent Xcode available for that version. Refer to the Xcode wikipedia article [en.wikipedia.org] for a versions and requirements overview.
Both OS X and iOS set Q_OS_MAC. OS X sets Q_OS_OSX. iOS sets Q_OS_iOS. On the Qmake side this corresponds mac, osx, and ios.
Don’t use Q_OS_MACX.
OS X and iOS share as much code as possible. This is done via the the static platformsupport library.
Use [NSApplication sharedApplication].
Rationale: While a little longer to type, [NSApplication sharedApplication] is type-safe an can save us from compiler errors.
Qt binaries are forward compatible: Compile on 10.X and run on 10.X+.
Qt binaries are backwards compatible: Compile on 10.X and run on prior versions. How far back you can go depends on the Qt version in use. This is accomplished by compile-time and run-time version checks (weak linking). Grep for MAC_OS_X_VERSION_MAX_ALLOWED and QSysInfo::MacintoshVersion in the Qt source code to see the pattern in use.
There are basically three types of branches that we use in Qt Creator development
We don’t create branches for patch releases.
The minor version branch is regularly merged up to Master.
Feature branches can be created for the development of code that the corresponding maintainer deems useful and potentially fit for merging into master when it is ready. Reasons for creating a feature branch instead of developing on a separate git repository, and posting the complete patch for review&merge after it is finished, can include but is not limited to
Life time of feature branches is at the maintainer’s discretion, i.e. if a feature branch is created at all, and when it will be removed again (e.g. when the code is ready for merge, or when the code is no longer developed).
Feature branches follow the naming wip/short-but-descriptive-name and should be announced on the mailing list.
The release branches go through several states, which are described here in chronological order:
The Freezing state starts shortly before the release candidate, and continues through the final minor.0 release, and a potential patch release. After that, the branch is put into Frozen mode. It can be defrosted by the Qt Creator maintainer if need arises, but that would be only in exceptional circumstances. After all, Qt Creator’s release cycle is tight and the next minor release not far away.]]>
Covering Qt5 only and so not mentioning “5”, just “Qt”..
See the list of know issues for BlackBerry 10 for now. Most of them are applicable. More details will be provided by time of the Qt 5.3.0 final release.
Please use the the QtPorts: QNX [bugreports.qt-project.org] component for QNX specific issues and other components for Qt generic issues even if you found them on QNX Neutrino OS.
BlackBerry and QNX run a Jenkins based CI system which conducts build and on-device unit tests:]]>
English Spanish Italian Magyar French [qt-devnet.developpez.com] Български
QML provides several mechanisms for styling a UI. Below are three common approaches.
QML supports defining your own custom components [qt-project.org]. Below, we create a custom component TitleText that we can use whenever our UI requires a title. If we want to change the appearance of all the titles in our UI, we can then just edit TitleText.qml, and the changes will apply wherever it is used.
In this approach we define a Style QML singleton object that contains a collection of properties defining the style. As a QML singleton, a common instance can be access from anywhere which imports this directory. Note that QML singletons require a qmldir file with the singleton keyword preceding the Style type declaration; they cannot be picked up implicitly like other types.
In this approach, we have a Style singleton that is used by our custom component.
If you need to nest QtObject to access more defined properties (i.e. border.width.normal) you can do the following:.
Currently, Qt documentation is hosted at three sites:
Here are the basic steps to help you get started contributing to the Qt documentation:
Qt’s documentation tool is QDoc. QDoc scans through the source and generates html pages regarding the classes, enums, QML types, and other parts of the
reference documentation.
To get started, the QDoc Guide [doc-snapshot.qt-project.org] explains how QDoc generates documentation from QDoc comments.
The process for submitting a documentation patch is the same as for source code. For more information, read the Code Reviews page.
For language reviews, documentation reviews, and technical reviews, you may add any of the relevant maintainers as reviewers as well as the following individuals:
For language reviews (particularly for non-native English speakers) only, you may also add any of the following individuals:
For documentation help, join the #qt-documentation channel in Freenode.]
The organization and development of Qt 5 documentation is covered in another wiki: Qt5DocumentationProject
The Qt Documentation Structure page provides information about the structure of the documentation.]]>
~/.4 branch):].
Up here in the calm and peaceful hills of Norway, we have been browsing the web during the long, dark winter nights. We found resources ranging from small how-tos to extensive tutorials, from beginner forums to places for exchange between experts. The choice is yours!
If you know about a site not listed here or happen to run your own community, feel free to add it.
Qt is present on Freenode [irc.freenode.net]
If you want to meet Qt developers and fellows in person please join Qt Meetups. Check the provided link for details and find out a Qt community near you!]]>
If single required
QtQuick 2.0 applications require OpenGL 2.1 or higher to run. Windows only provides OpenGL 1.1 by default, which is not sufficient. One workaround is to use ANGLE which implements the OpenGL ES 2 API on top of DirectX 9. The benefit of using ANGLE is that the graphics are hardware-accelerated but ANGLE requires Windows Vista or later. The other option is to use a software renderer such as Mesa which can run on Windows XP or later and may perform better than ANGLE when running inside virtual machines.
This article describes the process of cross-compiling Mesa for Windows on Arch Linux. The result is an opengl32.dll DLL that you can copy to the folder containing your application’s executable to use Mesa LLVMpipe software rendering.
Cross compiling is currently the only method that can compile the latest versions of Mesa for Windows using GCC. Compiling Mesa natively on Windows using GCC with Scons results in “the command line is too long” error during linking. There are known issues when compiling Mesa with optimizations using Visual Studio 2010. Compiling with Visual Studio 2012 is possible but requires Windows 7 and the default platform target does not support Windows XP. It is possible to cross compile using Cygwin or MSYS2 Scons.
Prebuilt binaries for Mesa are available from the MSYS2 project:
Note: Use of the strerror_s function is disabled by writing an entry to config.cache for Windows XP compatibility.
You can now copy opengl32.dll from the ~/mesa_win32/dist folder to the folder containing your application’s executable.
Your Qt must be compiled with Desktop OpenGL to use opengl32.dll. The ANGLE build will not load the mesa library.
Note: Use of the strerror_s function is disabled by writing an entry to config.cache for Windows XP x64 compatibility.
You can now copy opengl32.dll from the ~/mesa_win64/dist folder to the folder containing your application’s executable.
Your Qt must be compiled with Desktop OpenGL to use opengl32.dll. The ANGLE build will not load the mesa library.:).
Qt Creator supports compiling with a MinGW toolchain out of the box.
There are actually different MinGW toolchains and packages available:
MinGW.org [mingw.org] is the original project. The latest version gcc 4.7.2. It only compiles for 32 bit binaries.
MinGW-w64 [mingw-w64.sourceforge.net] is a fork with the original aim to also support generation of 64 bit binaries. By now it also supports a much larger part of the Win32 API. The MinGW-w64 project does host several different binary packages, done by different people.
There are binary installers targetting MinGW for both Qt 4 and Qt 5. Up to Qt 4.8.6, Qt 4 ones are built with a MinGW.org toolchain using gcc 4.4. Newer Qt 4.8 binary packages ship with a mingw-w64 based toolchain. For Qt 5, a newer MinGW-w64 toolchain is actually required.
This error occurs if object files / libraries being linked are compiled with different versions of mingw. The following steps can fix a problem:
mingw32-make distcleanin order to remove all object files that was compiled with different mings versions.
LIBRARY_PATHenvironment variable, for example
set LIBRARY_PATH=c:\qt\2010.04\mingw\lib. gcc linker have a very complicated library search algorithm1 that can result in wrong library being linked (for example, mingw can find installation of strawberry perl in PATH and use it’s library).
1 Mingw wiki about library search problems [mingw.org]]]>.]]>
tests/manual/debugger/simple/simple.pro and tests/manual/debugger/cli-io/cli-io.pro provide the needed code
TBD]]>
The Qt Multimedia module is supported on iOS, but there are some limitations in what is supported, and some additional steps that need to be taken to make use of the support. One of the unusual things about the iOS port is that everything must be compiled statically due to the Apple policy of dis-allowing share object files to be bundled with applications. It is not a problem to statically compile the Qt modules (including Multimedia) and link them into your application, but most of QtMultimedia’s functionality is provided by plugins. These plugins also need to be statically linked into your application, and to do that you must add a line to your qmake project file.
To access the low level audio API’s on iOS you need to statically).
i.
iOS has basic support for capturing images and videos via the builtin camera devices..
iOS also supports.
It may seem cumbersome to have to manually link these backends into each of your Qt applications, but the alternative would be to always include all 4 backends, which would unnecessarily increase the size and memory footprint of your iOS applications. This same issue exists in other modules that derive their functionality from plugins (ex QtSensors), so make sure to keep this in mind when building applications for iOS (or other platforms where you are statically linking your application).]]>
Hi everyone!
In this article I’ve tried to explain how to use Mac OS X Share API in your Qt Quick app. Share API was implemented in Mac OS 10.10 (Yosemite).
As you know all frameworks in OS X which you could use in your application created with Objective-C/C++. That’s why you can’t use framework in your C++ classes. You need to rename your .cpp file to .mm and then you can call Objective-C code. But sometimes you need to call methods with arguments with Objective-C. As you know in .h file you can’t call Objective-C code. You must create Objective-C class which will call all needed methods to work with target framework.
First you need to create class with all methods in Objective-C/C++ to use Share API. To do this you need follow a few steps:
Second class which you need to create is a class to call from C++. This class will call Objective-C/C++. To do this you need follow a few steps:
Import the new type to your QML file where you need to use share logic and add this code:
This Share item can share only text and link. If you need to share Image you can implement special logic to convert QImage to NSImage. And added a new parameter to method: shareCurrentContent().]]>.:
Plugins do not necessarily implement all possible features and different backends have different capabilities.
The following tables give an overview of what is supported by each backend in Qt 5.4.
Audio backends implement QAudioInput, QAudioOutput, QAudioDeviceInfo and QSoundEffect
Here is the list of the current audio backends:
Only m3u is supported at the moment.]]>
New Features in Qt 5.5
Qt 5.5 Tools & Versions [qt-project.org]
If this page is in a crude state, it’s because it’s a quick brain dump of experiences taking a simple (QQuickView + QML, minimal UI) app from Linux & OS X Desktop to iOS, and written in the hope it will be useful to other developers with Qt/Desktop experience who are quite unfamiliar with “mobile” and iOS and Xcode. Please feel free to edit mercilessly. This page doesn’t (yet) describe App Store submissions.
(If you’re happy just programming Xcode’s iOS device simulators then you just need a Xcode and a Mac running OS X; there’s no need to register as an iOS developer for that. Be warned the simulator performance characteristics are significantly different from real HW!)
Assuming you have a Qt project which builds for desktop from a qmake .pro file, you should be able to get an iOS build by:
Useful settings (can be got into the qmake-generated Info.plist using sed/regexps/xslt transforms… whatever works for you):
Additionally/alternatively Apple provides a useful utility /usr/libexec/PlistBuddy for modifying these files e.g
Stuff you need to know:
The workflow described above refers to deploying an app to a USB-attached iOS device.
If you want to send an “installer” for an app to someone remote with an iOS device (NB must be one which has your “team provisioning profile”):
The Qt Project has a meritocratic structure and it is important to know who does what. Find the details at The Qt Governance Model.
There are many areas and roles that still need to be documented.
See Infrastructure.
Not officially constituted, but see Marketing.]]>.]]>
English Italiano German Spanish Русский Magyar ಕನ್ನಡ
These are third party add-ons and libraries for Qt:
Third party add-ons and libraries under open source licenses:
Third party add-ons and libraries under commercial licenses:]]> | http://qt-project.org/wiki/Special:Recentchanges_Atom | CC-MAIN-2014-52 | refinedweb | 5,872 | 57.27 |
Summary
The SearchCursor function establishes a read-only cursor on a feature class or table. SearchCursor can be used to iterate through Row objects and extract field values. The search can optionally be limited by a where clause or by field and optionally sorted..
Search SearchCursor with a for loop.
import arcpy fc = "c:/data/base.gdb/roads" field = "StreetName" cursor = arcpy.SearchCursor(fc) for row in cursor: print(row.getValue(field))
Using SearchCursor with a while loop.
import arcpy
fc = "c:/data/base.gdb/roads"
field = "StreetName"
cursor = arcpy.SearchCursor(fc)
row = cursor.next()
while row:
print(row.getValue(field))
row = cursor.next()
Using SearchCursor with a while loop.
Syntax
SearchCursor (dataset, {where_clause}, {spatial_reference}, {fields}, {sort_fields})
Code sample
List field contents for Counties.shp. Cursor is sorted by state name and population.
import arcpy # Open a searchcursor # Input: C:/Data/Counties.shp # Fields: NAME; STATE_NAME; POP2000 # Sort fields: STATE_NAME A; POP2000 D rows = arcpy.SearchCursor("c:/data/counties.shp", fields="NAME; STATE_NAME; POP2000", sort_fields="STATE_NAME A; POP2000 D") # Iterate through the rows in the cursor and print out the # state name, county and population of each. for row in rows: print("State: {0}, County: {1}, Population: {2}".format( row.getValue("STATE_NAME"), row.getValue("NAME"), row.getValue("POP2000"))) | http://pro.arcgis.com/en/pro-app/arcpy/functions/searchcursor.htm | CC-MAIN-2018-26 | refinedweb | 208 | 54.49 |
DLCLOSE(3C) DLCLOSE(3C)
dlclose - close a shared object
cc [flag ...] file ... -lc [library ...]
#include <dlfcn.h>
int dlclose(void *handle);
dlclose disassociates a shared object previously opened by dlopen,
sgidladd, or sgidlopen_version from the current process. Once an object
has been closed using dlclose, its symbols are no longer available to
dlsym or to the program. All objects loaded automatically as a result of
invoking dlopen, on the referenced object [see dlopen(3) sgidladd, or
sgidlopen_version] are also closed (however no object still open via any
dlopen, sgidladd, or sgidlopen_version is closed till the last open
handle is dlclosed).
handle is the value returned by a previous invocation of dlopen.
dlerror(3), dlopen(3), sgidlopen_version(3), sgidladd(3), dlsym(3),
dso(5).
If the referenced object was successfully closed, dlclose returns 0. If
the object could not be closed, or if handle does not refer to an open
object, dlclose returns a non-0 value. More detailed diagnostic
information is available through dlerror.
A successful invocation of dlclose does not guarantee that the objects
associated with handle are actually.
Use of dlclose on a DSO can cause surprising side effects because dlclose
forces many symbol's GOT entries to be reset for re-lazy-evaluation. A
result of this is that previously-saved (by the program or a DSO)
function pointers may hold obsolete or incorrect values.
Page 1
DLCLOSE(3C) DLCLOSE(3C)
Symbol lookups proceed in order on a linear list, and a DSO is not opened
twice with the same version number (unless different dlopen paths make
the DSO name appear different to rld). When multiple sgidladds are done
and an earlier DSO is dlclosed this can change what symbol a call is
resolved to and even result in unintentionally calling different routines
(with the same name) from a single place in the program at different
times. See the discussion of this in the dlopen description under
"NAMESPACE ISSUES".
PPPPaaaaggggeeee 2222 | https://nixdoc.net/man-pages/IRIX/man3/dlclose.3.html | CC-MAIN-2022-27 | refinedweb | 324 | 50.77 |
Fork and clean up Search
Dialog .js
RESOLVED WORKSFORME
Status
▸
Mail Window Front End
People
(Reporter: Joey Minta, Assigned: Joey Minta)
Tracking
(Blocks: 1 bug)
Firefox Tracking Flags
(Not tracked)
Details
Attachments
(2 attachments)
Created attachment 326142 [details] [diff] [review] patch v1. The attached patch is an mq patch based on a tree where the shared SearchDialog.js was copied into mail/, so that I can show what I intended to change about the javascript file. The rest of the patch is a normal patch. As a result of this patch, the global scope of the Search dialog has been reduced by 60% (from 701 to 270 items). In my rough profiling, the time to open the search dialog (that has already been opened before) has dropped by 10-15% (from ~93ms to ~82ms). The time to open the dialog after rebuilding has dropped over 50% (from ~980ms to ~410ms).
Attachment #326142 - Flags: review?(bienvenu)
(In reply to comment #0) >. So from what I can see the differences between the two SearchDialog.xul files is not that large, I expect only a couple of bugs need to be ported - and even if we end up not merging the two xul files, just making them even should enable us to keep the js files the same. Have you tried asking the SeaMonkey team (either the council or moz.dev.apps.seamonkey) if someone is prepared to do this within, say, the next month? IMHO the pain caused by forking a file (especially one such as this) is far greater than waiting a few weeks for a merge. I've been feeling this in various places - LDAP autocomplete is one, if I change the APIs, I currently need to change the code in 3 places. This costs me more and everyone afterwards. Obviously if we're getting near to final or if it is really blocking work, and there is no action on the SeaMonkey front, then yes, we should fork it - but can we at least ask the question first?. Are there plans to un-fork those files I've un-included soon?
Up to now, we tried to keep as much code as possible in sync, even if it wasn't shared, so that eg. extension authors mustn't care much about how to port their stuff. And, more importantly, so that developers didn't need to hunt down fine details in both apps just for making a backend change. I'm not sure that hasty forking does any good here. I am sure that your actual changes are for the better. ;-) The differences in how this dialog is used/"fed" with data shouldn't be too big.
(In reply to comment #2) >. I'm not saying you need to track SeaMonkey's dependencies as well. All I'm really asking for is giving the SeaMonkey folk a chance to bring the SeaMonkey code "up to date", so that this change can be made without forking. Just taking a quick look at the main differences between the two xul files: SeaMonkey has: bug 83968 (Allow local searches even when online) SeaMonkey has: help button - but Thunderbird wouldn't want this at the moment Thunderbird's version includes a copy of the xul code for the thread pane (SeaMonkey includes threadPane.xul. Thunderbird has: Bug 413781 XBLify folder-selection menus So the main bug for SeaMonkey to port asap would be bug 413781, and I believe work has already started on moving the xbl code for that. If the changes on the search dialog are done first, then I think this wouldn't take too long to do. Your patch can then be re-adjusted to work with the currently core SearchDialog.js, then the SeaMonkey team tests it out and depending on length of time to make changes, we either land and break SeaMonkey temporarily (i.e. with know regressions), or give them a couple of extra days to prepare fixes..
(In reply to comment #4) >. I think I didn't make this clear enough earlier - probably because I changed my mind at the end of comment 4, but left the information in just for reference. What I'm trying to say as the main point, is that we should be working with the SeaMonkey team in situations like this to land the patch on the core code. If someone working on one application doesn't want to do the work for the other application, that's fine, but please give the other application a chance to try the patch and do appropriate changes before deciding to fork a file. If the other application takes on the patch, then regressions in their application on landing will be their responsibility. Forking has, and still is costing us. We need to minimise it wherever possible. If I seem to be trying to dictate/preach, I apologise - working with both applications and seeing the missed opportunities because of forking means I care a lot about what both sides do in this area.
I'd rather not do hasty forking either.
Comment on attachment 326142 [details] [diff] [review] patch v1 I'm going to minus for now, and hope that we can work this out with SeaMonkey fairly quickly.
Attachment #326142 - Flags: review?(bienvenu) → review-
Created attachment 326391 [details] [diff] [review] patch v2 This is the patch applied to the current SearchDialog.js, with a rough port to SeaMonkey's SearchDialog.xul as well. I have no idea what it does there, because, as I said, I don't know the interactions among the various other includes/overlays that SeaMonkey has in its dialog. I also resent the claim that this fork was in any way "hasty." Filing this bug was not a spur of the moment decision on my part, but something I thought hard about. The continued fork of the xul files while sharing the js remains absurd in my mind. I've been struggling with the search dialog for the last few months in trying to de-rdf Thunderbird, and it's broken several of my patches. In general, the codebase is plagued by shared files that make assumptions about the forked files they depend on. The search dialog files remain the most obvious offender, but threadpane.js and messengerdnd.js are other significant examples. A shared base for mailnews is fine and good, but a base that depends on its consumers is not a base. It's just a nightmare.
Attachment #326391 - Flags: superreview?(bienvenu)
Attachment #326391 - Flags: review?(bienvenu)
Sorry, jminta, didn't know you'd been working on the search dialog for the last few months. I agree that forking the xul and sharing the js isn't going to work very well in general, and we're going to need to figure out how to share more xul or share js differently. I'll try this patch in the next day or so - it would be great if a Seamonkey person could try it as well.
Comment on attachment 326391 [details] [diff] [review] patch v2 r/sr=me, with some nits. I ran TB with this patch and things seemed to work. I don't know about SM... + if (destUri.length == 0) { + destUri = destFolder.getAttribute('file-uri') + } no need for the extra braces here. + return rdfService.GetResource(uri).QueryInterface(Components.interfaces.nsIMsgFolder); +} \ No newline at end of file missing a newline. + if (!uri || uri[0] != 'n') { + return false; + } + else { + return ((uri.substring(0,6) == "news:/") || (uri.substring(0,14) == "news-message:/")); + } don't need braces here either - could do this in one statement using ? operator, if you wanted to...
Attachment #326391 - Flags: superreview?(bienvenu)
Attachment #326391 - Flags: superreview+
Attachment #326391 - Flags: review?(bienvenu)
Attachment #326391 - Flags: review+
Caching the stop button using gSearchStopButton seems a useful optimization. Any particular performance reason for uncaching it?
(In reply to Comment #8) > Created an attachment (id=326391) > diff -r 5fd4720bd717 mailnews/base/search/resources/content/SearchDialog.xul -<?xul-overlay href="chrome://communicator/content/utilityOverlay.xul"?> Just doing some preliminary code inspection. There seems to be at least two reasons why SeaMonkey mailnews references utilityOverlay.xul 1. There is an offline status indicator in the mailnews search dialog statusbar that depends on utilityOverlay.{xul|js}. If we remove the offline statusbarpanel then it looks like we can remove this dependency. 2. We have a help button that calls openHelp(). This currently resides in the toolkit contextHelp.js. We can reference this script directly.
(In reply to comment #11) > Caching the stop button using gSearchStopButton seems a useful optimization. > Any particular performance reason for uncaching it? (1) document.getElementById() is really fast, fast enough that there's virtually no difference between the performance impact of calling it, and the performance impact of adding another item to the global scope against which may js variable/funtion resolutions will occur. (2) It's a useless optimization, since afaict, it's not a significant signature in any performance measurements in these functions. If you so a performance analysis of some tbird function where getElementById shows up as significant, I'd be *really* curious to see it. (In reply to comment #12) > Just doing some preliminary code inspection. There seems to be at least two > reasons why SeaMonkey mailnews references utilityOverlay.xul OK, Seamonkey people need to tell me quickly what they want me to do. Right now I see two options. (A) I can land this patch as is, and you can fix what, if anything breaks there. (B) I can land this patch without any changes to the includes/overlays of Seamonkey's xul file, and you can fix what breaks as a result of the then double-declarations of a variety of functions and variables within this scope.
Comment on attachment 326391 [details] [diff] [review] patch v2 >diff -r 5fd4720bd717 mail/base/content/msgMail3PaneWindow.js >diff -r 5fd4720bd717 mailnews/base/resources/content/msgMail3PaneWindow.js >diff -r 5fd4720bd717 mailnews/base/resources/content/threadPane.js Bits of other patches? >- gSearchStopButton.setAttribute("label", gSearchBundle.getString("labelForSearchButton")); >- gSearchStopButton.setAttribute("accesskey", gSearchBundle.getString("labelForSearchButton.accesskey")); >+ var stopButton = document.getElementById("search-button"); >+ stopButton.setAttribute("label", gSearchBundle.getString("labelForSearchButton")); >+ stopButton.setAttribute("accesskey", gSearchBundle.getString("labelForSearchButton.accesskey")); Maybe make the stop button a member variable? >+ const VIRTUAL = Components.interfaces.nsMsgFolderFlags.Virtual; >+ if (!folder || !folder.server.canSearchMessages || (folder.flags & VIRTUAL)) { You didn't make this a constant anywhere else, which seems inconsistent. (Also you had two spaces after =) > function updateSearchFolderPicker(folderURI) > { >- SetFolderPicker(folderURI, gFolderPicker.id); >+ SetFolderPicker(folderURI, "searchableFolders"); >+ var rdfService = Components.classes["@mozilla.org/rdf/rdf-service;1"] >+ .getService(Components.interfaces.nsIRDFService); > > // use the URI to get the real folder >- gCurrentFolder = >- RDF.GetResource(folderURI).QueryInterface(nsIMsgFolder); >+ gCurrentFolder = rdfService.GetResource(folderURI) >+ .QueryInterface(Components.interfaces.nsIMsgFolder); Make use of GetMsgFolderFromUri perhaps? >+ var mailSession = Components.classes["@mozilla.org/messenger/services/session;1"] >+ .getService(Components.interfaces.nsIMsgMailSession); > var nsIFolderListener = Components.interfaces.nsIFolderListener; > var notifyFlags = nsIFolderListener.event; >- gMailSession.AddFolderListener(gFolderListener, notifyFlags); >+ mailSession.AddFolderListener(gFolderListener, notifyFlags); You didn't bother with the temporary variable when removing the listener. >-function IsThreadAndMessagePaneSplitterCollapsed() Oops, how long has that been lying dormant :-[ >+ var rdfService = Components.classes["@mozilla.org/rdf/rdf-service;1"] >+ .getService(Components.interfaces.nsIRDFService); > >+ var destResource = RDF.GetResource(destUri); > >+ var destMsgFolder = destResource.QueryInterface(Components.interfaces.nsIMsgFolder); GetMsgFolderFromUri again! > function BeginDragThreadPane(event) > { > // no search pane dnd yet > return false; > } Ah, I see why this lets you remove messengerdnd.js >+function GetSelectedIndices(dbView) { >+ var indices = {}; >+ dbView.getIndicesForSelection(indices, {}); >+ return indices.value; >+} Ooh, this is just asking to be turned into a retval! >+ view.getURIsForSelection(messageArray,length); >+ if (length.value) >+ return messageArray.value; >+ else >+ return null; As is this! >+//Ported from mailWindowOverlay.js So this isn't a copy? I'm just not sure of the benefit of duplicating code... >+// end commandglue copying >+ >+var gStatusFeedback = { ... >+// So we don't have to include widgetglue.js So where's gStatusFeedback copied from? >diff -r 5fd4720bd717 mailnews/base/search/resources/content/SearchDialog.xul >-<?xul-overlay href="chrome://communicator/content/utilityOverlay.xul"?> As long as SearchDialog.xul remains forked, suite needs this line.
(In reply to comment #14) > Bits of other patches? No, that's me moving the global gThreadTree to the file that actually uses it. > Maybe make the stop button a member variable? We could, but I'm still really skeptical that caching DOM nodes is at all useful except in the most extreme of circumstances. > > >+ const VIRTUAL = Components.interfaces.nsMsgFolderFlags.Virtual; > >+ if (!folder || !folder.server.canSearchMessages || (folder.flags & VIRTUAL)) { > You didn't make this a constant anywhere else, which seems inconsistent. I did it here to try to help with the 80char limit. > (Also you had two spaces after =) Doh. > Make use of GetMsgFolderFromUri perhaps? Then I can't remove widgetglue.js > > >+//Ported from mailWindowOverlay.js > So this isn't a copy? I'm just not sure of the benefit of duplicating code... It's a 95% copy, I removed other dependencies in these functions (such as gPrefBranch). The point is that it's better to just copy 1 function, rather than include a 3000line javascript file. If SearchDialog.js wanted 10 functions from the file, then we should probably include it (that's why threadpane.js stays), but here, it's not worth the performance hit of parsing the huge file. (see timing numbers above) > So where's gStatusFeedback copied from? It's not. It's a slimmed down version of nsMsgStatusFeedback in mailWindow.js > > >diff -r 5fd4720bd717 mailnews/base/search/resources/content/SearchDialog.xul > >-<?xul-overlay href="chrome://communicator/content/utilityOverlay.xul"?> > As long as SearchDialog.xul remains forked, suite needs this line. OK, I'll restore at least that one on checkin. Still waiting on a report of how the suite checkin should be structured...
I'm going to look into unforking the XUL in 441340...
(In reply to comment #15) > (In reply to comment #14) > > Bits of other patches? > No, that's me moving the global gThreadTree to the file that actually uses it. Sure, but this bug isn't called "Move the global gThreadTree to the file that actually uses it", nor did any of the previous comments mention it. > > >+ const VIRTUAL = Components.interfaces.nsMsgFolderFlags.Virtual; > > >+ if (!folder || !folder.server.canSearchMessages || (folder.flags & VIRTUAL)) { > > You didn't make this a constant anywhere else, which seems inconsistent. > I did it here to try to help with the 80char limit. You could just wrap it onto a second line... that's acceptable, you know ;-) > > Make use of GetMsgFolderFromUri perhaps? > Then I can't remove widgetglue.js I mean the one you copied, of course... > The point is that it's better to just copy 1 function Remember, two functions are twice as hard to maintain. Would it be better to make a new file shared between search and 3pane? > > So where's gStatusFeedback copied from? > It's not. It's a slimmed down version of nsMsgStatusFeedback in mailWindow.js IMHO a comment to that effect would be useful.
(In reply to comment #14) >(From update of attachment 326391 [details] [diff] [review]) >>+function GetSelectedIndices(dbView) { >>+ var indices = {}; >>+ dbView.getIndicesForSelection(indices, {}); >>+ return indices.value; >>+} >Ooh, this is just asking to be turned into a retval! Fixed in bug 442256.
Like Philip already mentioned, SM's statusbar and help depend on other code. But even without the removals to SM's SearchDialog.xul, its status bar will be broken courtesy to the SearchDialog.js changes: * Call to xpconnect wrapped JSObject produced this error: * [Exception... "'[JavaScript Error: "document.getElementById("statusbar-progresspanel") is null" {file: "chrome://messenger/content/SearchDialog.js" line: 894}]' when calling method: [nsIMsgSearchNotify::onNewSearch]" nsresult: "0x80570021 (NS_ERROR_XPC_JAVASCRIPT_ERROR_WITH_DETAILS)" location: "JS frame :: chrome://messenger/content/SearchDialog.js :: onSearch :: line 418" data: yes] Furthermore, certain functionality will be broken: - "Open" button defunct - File As" defunct "JavaScript error: chrome://messenger/content/SearchDialog.js, line 719: RDF is not defined" - Save Search comes up, but doesn't saves anything And, apart from that, duplicating markup (back then when forking this) and now a gazillion methods in code is *really* a very bad idea on its own, even if you wouldn't break innocent bystanders. It would have been much more useful to first file a bug, discuss what to do and then fix it according to the results of that discussion...
I think comment #19 reaffirms the benefits of a fork, by demonstrating that the underlying forked files that the dialog depends on are just too different to be reliably used. With the exception of the File As error, which is a typo in the patch, all of the other functions work fine in my build of Thunderbird. Notwithstanding that, my current plan of action is to therefore check in this patch without any changes to SeaMonkey's copy of the xul file. This gives Thunderbird the performance win, while hopefully not breaking SeaMonkey as severely. (In reply to comment #19) > And, apart from that, duplicating markup (back then when forking this) and now > a gazillion methods in code is *really* a very bad idea on its own, even if you > wouldn't break innocent bystanders. Let's be clear. I'm copying 8 functions from 4 different files. In no case am I copying more than 3 functions from any particular file. Including files with literally hundreds of functions in order to use 2-3 of them is just wrong, and the benefits to the user (increased performance) will always outweigh any increases in developer complexity. Even with these duplicated functions, I still argue that this actually makes the overall codebase *easier* to maintain, since no longer do you have to guess what changes in these no-longer-included files might break in the search dialog. When trying to do things like de-rdf, which involves excising RDF-dependent functions, this is a non-trivial benefit to the hacker. > It would have been much more useful to first file a bug, discuss what to do and > then fix it according to the results of that discussion... > I don't understand what there is/was to discuss. The SearchDialog contains a demonstrable inefficiency/performance loss in that it has an overly complex set of functions/variables in its global scope. I wanted to fix that, and the patches here do exactly that. If I had filed this bug first, what different approach would you have suggested? (Wait for someone to potentially unfork the xul, which would then make this solution impossible and the bug permanent, since seamonkey has proven different requirements?)
(In reply to comment #20) > Let's be clear. I'm copying 8 functions from 4 different files. In no case am > I copying more than 3 functions from any particular file. Including files with (Would putting these common functions a separate shared file(s) work ?)
(In reply to comment #21) > (Would putting these common functions a separate shared file(s) work ?) > It depends on what you mean by "work." If you mean would the code still all run, yes. Architecturally, though, it strikes me as plain wrong. This would be a file with no modularity/purpose/area of functionality, but instead one simply defined by the needs of today as "all functions that are needed in both xul files." In a front-end that doesn't have namespace-like global variables (or ES4 actual namespaces), files seem to be the only structural component capable of defining a module, and thereby creating some code independence. I'd prefer not to create files on an ad-hoc basis to solve problems like this, absent the duplication of a lot more code. (No, don't ask me for a specific threshold, I don't have one, but I'm pretty confident this is on the small side of the line.) Creating an ad-hoc defined file like this undermines any attempt at creating that modularity within front-end code.
I'm OK with the minor duplication of js methods. I think the de-forking process and the de-rdfication processes are a bit at odds, but there's a lot more energy and urgency behind the de-rdfication process, so the de-forking needs to take a bit of a back seat.
Just to be clear, I think de-forking is a huge win for SM and TB, and I'm all for it. It might be easier, though, once de-rdfication is done.
So, where are we here? I've been ignoring two (undoubtedly rotten by now) reviews that depend on this for two months now, and I'm getting rather tired of seeing them in my queue.
searchdialog.js is forked nowadays, and the most stuff suggested here looks fixed/obsoleted. -> WFM
Status: ASSIGNED → RESOLVED
Last Resolved: 4 years ago
Resolution: --- → WORKSFORME
(In reply to Magnus Melin from comment #26) > searchdialog.js is forked nowadays, and the most stuff suggested here looks > fixed/obsoleted. -> WFM Magnus, Thanks for the cleanup! What does this suggest about bug 441340? Should it be wontfix, or is there really still good reason to defork at some point? (Also, it currently has no open blockers)
Flags: needinfo?(mnyromyr)
Flags: needinfo?(mnyromyr) | https://bugzilla.mozilla.org/show_bug.cgi?id=441077 | CC-MAIN-2018-13 | refinedweb | 3,499 | 57.77 |
Python:
import matplotlib matplotlib.use("Agg") import matplotlib.pyplot as plt import base64 from io import BytesIO def sparkline(data, figsize=(4, 0.25), **kwags): """ Returns a HTML image tag containing a base64 encoded sparkline style plot """ data = list(data) fig, ax = plt.subplots(1, 1, figsize=figsize, **kwags) ax.plot(data) for k,v in ax.spines.items(): v.set_visible(False) ax.set_xticks([]) ax.set_yticks([]) plt.plot(len(data) - 1, data[len(data) - 1], 'r.') ax.fill_between(range(len(data)), data, len(data)*[min(data)], alpha=0.1) img = BytesIO() plt.savefig(img, transparent=True, bbox_inches='tight') img.seek(0) plt.close() return base64.b64encode(img.read()).decode("UTF-8")
I had to change the class used to write the image from StringIO to BytesIO and I found I needed to decode the bytes produced if I wanted it to display in a HTML page.
This is how you would call the above function:
if __name__ == "__main__": values = [ [1,2,3,4,5,6,7,8,9,10], [7,10,12,18,2,8,10,6,7,12], [10,9,8,7,6,5,4,3,2,1] ] with open("/tmp/foo.html", "w") as file: for value in values: file.write('<div><img src=".format(sparkline(value)))
And the HTML page looks like this:
About the author
Mark Needham is a Developer Relations Engineer for Neo4j, the world's leading graph database. | https://markhneedham.com/blog/2017/09/23/python-3-create-sparklines-using-matplotlib/ | CC-MAIN-2019-13 | refinedweb | 255 | 53.47 |
How to drop console statements in production
Hello,
I’m trying to find a way to remove all
console.logstatements from my production build.
On a previous version of quasar I had updated the webpack configuration for
UglifyJsPluginto drop console statements with
drop_console: true.
What approach are folks talking with the latest version in terms of managing logging in production (i.e. dropping debug or just doing another way).
Thanks!
Would like to know too
.eslintrc.js
// allow console.log during development only
‘no-console’: process.env.NODE_ENV === ‘production’ ? ‘error’ : ‘off’,
Running quasar build will result in something like this
ERROR in ./src/components/user/UserTabRoles.vue
Module Error (from ./node_modules/eslint-loader/index.js):
C:\Users\xxx\code\quasar\infosys\src\components\user\UserTabRoles.vue
210:25 error Unexpected console statement no-console
236:25 error Unexpected console statement no-console
2 problems (2 errors, 0 warnings)
Also running into this issue. I read that someone configure terser () to use the drop_console option, however I would prefer not to add additional library if this can be done as is.
I’ve used the loglevel module with the corresponding Quasar boot file (loglevel.js):
//
import loglevel from ‘loglevel’;
const isDevelopment = process.env.NODE_ENV === ‘dev’;
loglevel.setLevel(isDevelopment ? ‘debug’ : ‘error’, false);
window.console = loglevel;
- Allan-EN-GB Admin last edited by
Uglify (which comes baked in with Quasar) handles this:
@Allan-EN-GB
Sorry, I have problems getting removal of console.logs in production working: Based on the answer to this StackOverflow post, I added to my quasar.conf the following:
build: { env: ctx.dev ? { // son dev we'll have // some settings for dev here... } : { // and on build (production) uglifyOptions: { compress: { drop_console: true } }, // some other prod settings go here... }
After doing a successful production build and deployment (on Heroku), I still see all console.logs statements from my Quasar app in the browser console.
What could be wrong with my approach?
Gentle reminder: Anyone who knows how to get rid of console.logs in production?
@Mickey58 I’m wondering… what is this
envproperty in your build config ?
I would make it like this : (didn’t try)
build: { uglifyOptions: { compress: { drop_console: !ctx.dev } } // ... Other build options }
Thanks, I tried your suggestion, but still get console log output.
My quasar.conf follows the official template from the Quasar docs on
Afaik, process.env is the same as ctx.dev, which is true for a dev environment and false for a prod environment. So it should set drop_console to true in a prod environment.
Still not sure why it doesn’t work.
@Mickey58 said in How to drop console statements in production:
My quasar.conf follows the official template from the Quasar docs on
This is for adding something in process.ENV object, not to change your build options.
@Mickey58 said in How to drop console statements in production:
Thanks, I tried your suggestion, but still get console log output.
That’s strange. I tried on my app, and console.log are removed on production build.
Can you share your whole
buildsection of
quasar.conf.js?
@tof06 - thanks for that hint, it looks like I misunderstood that template. I added the uglifyOptions now in front of that env: in the build section, and with a fresh build on Heroku, the console.logs are gone, so that problem is solved.
Unfortunately I get another problem (CORS error on some of the requests from the Quasar frontend to the backend) with that build. I still have to diagnose whether it is a side effect of the drop_console or a separate problem.
It may work! | https://forum.quasar-framework.org/topic/2655/how-to-drop-console-statements-in-production | CC-MAIN-2021-04 | refinedweb | 598 | 59.9 |
I have three static arrays of strings that specify how to translate each number value into the desired format. However I am stumped as to how I would complete the rest of the program. When I searched the forums, I wasn't able to find any such posts using classes.
I need to create a constructor that accepts a nonnegative integer and uses it to initialize the Numbers object. I also need a member function for example print() which obviously prints the English Description.
#include <iostream> using namespace std; class Numbers { private: int number; public: char lessThan20[20][25] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"}; char hundred[] = "hundred"; char thousand[] = "thousand"; }; int main() { int number; //Ask user for number input cout << "Enter a number between 0 and 9999: "; cin >> number; while (number < 0) { cout << "This program does not accept negative numbers." << endl; cout << "Enter a number between 0 and 9999: "; cin >> number; } while (number > 9999) { cout << "This program does no accept numbers greater than 9999." << endl; cout << "Enter a number between 0 and 9999: "; cin >> number; } system("PAUSE"); return 0; } | http://www.dreamincode.net/forums/topic/116601-c-program-to-convert-number-to-words-using-classes/ | CC-MAIN-2017-51 | refinedweb | 194 | 55.78 |
Warning! This post is mathematical. Disinterested readers beware!
One of the goals of time series analysis is to model the signal underlying the data. If the data have some random element to them, they’ll follow some probability distribution. The distribution might be dependent on external variables (like time), in which case we usually create a model in which the mean of the distribution is time-dependent. Suppose, for example, we model a variable as following a straight line time trend, plus random noise:
,
where the “noise” part
follows the normal distribution with mean 0 and standard deviation
. This is the same as saying that
follows the normal distribution with time-dependent mean
and standard deviation
. Then our model is that the probability density for a given
value is
.
We generally call this the probability, but we can also call it the likelihood of getting the value
.
The model
may be very useful; it might enable us to make inferences about the physical system or even make forecasts of future behavior. But as useful as it is, it’s probably not true. The behavior of physical systems can be quite complicated, and many systems show chaotic detailed behavior (although their long-term statistical behavior may be stable), so a complete description of reality may not be simple enough to encompass in a practical statistical model. And, data are often limited so we’re forced to use simple models (like straight-line trends) which we can’t expect to reflect that absolute truth of complex systems. If you do statistics long enough you begin to appreciate the classic statement that “All models are wrong. Some models are useful.”
But presumably the “truth” is out there, right? There must be some probability function
which describes the “true” distribution for our variable
— we just don’t know what it is. It probably involves time dependence, maybe dependence on other external variables, and requires some parameters as well, but at least (we presume) it exists. Maybe we can’t know what it is (not in a finite lifetime anyway), but that doesn’t alter the fact that it exists.
If the “true” distribution is
, and our (probably simple, maybe useful, almost surely wrong) model is
, then how far are we from the truth? To get an idea, let’s recall the definition of the entropy of a probability distribution. The entropy of the distribution
is the expected value of the negative of the logarithm of
. That’s a lot of words! We can express it as an equation by saying
,
where the angle brackets
indicate the expected value of the enclosed quantity. The expected value of any quantity
depending on a random variable
which is governed by the probability distribution
is
,
so the entropy of the distribution is
.
If the expected value of the negative logarithm of the true distribution is the entropy, what about the expected value of the negative logarithm of our model distribution? That would be
,
and is called the cross-entropy.
There are many ways to show that the cross-entropy is always bigger than the entropy — unless the model
is equal to the “truth”
, in which case it is equal to the entropy.
Since the cross-entropy is always bigger than the entropy (unless the model is correct), this motivates us to use the difference as a measure of how close the model is the the “truth”. We define the Kullback-Leibler divergence as the difference between the cross-entropy and the entropy
.
Let’s illustrate with a simple example: flipping a coin. The random variable
is discrete rather than continuous, taking only the values 0 (“tails”) or 1 (“heads”), so instead of a continuous probability distribution
we only have probabilities
of getting tails and
of getting heads. Suppose the coin is fair so that
. Then the entropy is computed by replacing the integral by a sum
We can model the coin flip by supposing that theprobability of heads has some value
, so the probability of tails is of course
. The expected negative logarithm of this model (the cross-entropy) is
.
We can combine terms to get
.
Here’s a plot of the cross-entropy as a function of our model parameter
:
Clearly, the cross-entropy is minimum when the parameter
is the true probability 0.5, hence the KL divergence is zero only when the model is correct. It’s also obvious that the further our model parameter is from the truth, the greater is the KL divergence.
Of course, to measure the KL divergence we need to know what the “true” probability
is. But if we knew that, we wouldn’t need to test models! So how does this help us choose the best model when the truth is unknown? Stay tuned …
P.S. Thanks to Mrs. Tamino for her help … especially since all the equations mean nothing to her.
CM // October 5, 2009 at 10:12 pm |
Mrs Tamino is not just typing, she’s typing LaTeX? You \emph{lucky} man!
Nick Barnes // October 5, 2009 at 11:31 pm |
You mean “uninterested”. Otherwise excellent, looking forward to part 2.
Ray Ladbury // October 5, 2009 at 11:40 pm |
Tamino,
YES!!! A very clear exposition of this concept. I think a lot of people don’t fully appreciate the power of having a metric that can be minimized for the truem model. Some poeple dismiss the K-L divergence merely because it cannot be calculated. However, its very existence is the important thing. It shows that as a model approaches the true model, the K-L distance decreases. We cannot know when we’ve reached the true model, but the concept is really key to understanding an information theoretic approach to statistical modeling. I’m looking forward to the rest!
David B. Benson // October 6, 2009 at 12:55 am |
I’m tuned! I’m tuned!
And hearty thanks to Mrs. Tamino.
Nathan // October 6, 2009 at 1:13 am |
Nick Barnes
Don’t want to be a pedant, but I think Tamino may be correct. My understanding is that ‘un’ refers to something that has now changed to be the opposite of what it was (like undo, undone etc).
dhogaza // October 6, 2009 at 1:34 am |
Sigh …
Either serves for this meaning … ” By various developmental twists” is probably secret code for “people centuries ago were just as confused about the two as we are today …”
David Horton // October 6, 2009 at 1:46 am |
Fine, fine, but what about those mysterious oscillating graphs from central England? Is the body in the library with the candlestick?
David Horton // October 6, 2009 at 3:20 am |
Yeah, I’m a pedant to. It should be “uninterested” meaning to have no interest in the topic. Disinterested means to have no involvement (usually of a financial or legal nature) in the topic – that is you can comment on it objectively with nothing to gain personally. One of those pairs of words where meaning is lost in modern times (think reluctant and reticent)
David Horton // October 6, 2009 at 3:22 am |
Or, as us pedants like to say, “I’m a pedant too …”
Gavin's Pussycat // October 6, 2009 at 11:01 am |
mee tooo ;-)
ekzept // October 6, 2009 at 1:03 pm |
K-L divergence can be adapted to other purposes, too. Suppose there is a time series of estimates for a probability density, D[k], say each given by an empirical cumulative distribution function. Assumption successive captures of D[k] are suitably adjusted for power and representativeness, The symmetrized K-L can be used to generate an index of how dissimilar D[k] is from D[1+k].
Hank Roberts // October 6, 2009 at 3:06 pm |
We must bury this grammatical kerfluffle. It should remain uninterred no longer. Or if was once interred, then disinterred, it should be reinterred, permanently, not intermittently. Thank you.
Timothy Chase // October 6, 2009 at 3:36 pm |
Ray Ladbury wrote:
Well, I am interested, Tamino. Just my luck, I bet part two comes out tomorrow. In any case, I will see how far I can follow. Oh — and congratulations regarding your wife — sounds like a real partner in life.
ekzept // October 6, 2009 at 3:54 pm |
I don’t understand the “cannot be calculated” part. Surely K-L is useless as an objective standard as the post seems to imply, but comparisons like those I suggested may serve as the basis for inference.
Indeed, there’s a book by Pardo based upon the idea of using divergence measures for inference. I kind of reviewed it on Amazon. It is highly technical, and is not really self-standing, needing support from book by Read and Cressie (Goodness-of-Fit Statistics for Discrete Multivariate Data), and that’s unfortunate.
ekzept // October 6, 2009 at 3:56 pm |
There is is also a readable account of how these measures might be used by M.R.Forster in A.Zellner, H.A.KeuzenKamp, M.McAleer, Simplicity, Inference, Modelling called “The New Science of Simplicity”, Cambridge University Press, 83-119, 2001.
Mark // October 6, 2009 at 9:18 pm |
“Or, as us pedants like to say, “I’m a pedant too …””
Pendants are well known for hanging about.
Ray Ladbury // October 6, 2009 at 11:38 pm |
ekzept,
The “cannot be calculated” statement derives from the fact that K-L divergence requres knowledge of the true model. That is precisely why its utility is as a comparative metric. My comment was meant to address some of the attitudes I’ve run into when using such metrics. Not everyone understands the value of a comparative metric or of model selection.
ekzept // October 7, 2009 at 3:18 am |
Thanks, Ray. Indeed. M.R.Forster addresses some of these matters in the context of biology.
My only puzzlement is their puzzlement. I mean, aren’t likelihood ratios comparison tests, often of a candidate against the default “explainable by change”? I can see it takes a tad more sophistication to see LR as a means of comparing competing hypotheses, but not much.
ekzept // October 7, 2009 at 3:19 am |
Sorry “change” –> “chance”.
Al // October 7, 2009 at 5:38 am |
Sorry, but I’ve just got to say this:
Some of my best friends are Americans, (of course) but…”uninterested” always meant “not interested”, and “disinterested” always meant “impartial” UNTIL THE AMERICANS GOT HOLD OF THEM. (“momentarily” is another particularly disconcerting one.) dhogaza can euphemistically describe the situation as “various developmental twists”, but it just points to his being from the USA, where the importance of spelling as a means of precise communication just doesn’t seem to apply so much (in my opinion, and it doesn’t apply to their literary giants, of course, only the education system, I guess)!
By the way, a correction of a minor typo: -0.5 ln(0.5) – 0.5 ln(0.5) = -ln(0.5), not -ln(2)
[Response: First: the post says ln(2) not -ln(2) (always has), so the error is yours.
Second: I'm no fan of the verbal or written language skills of Americans, but it sounds like you're just "puttin' on airs."]
TrueSceptic // October 7, 2009 at 5:19 pm |
I wonder what happened here. Did Al forget that
a*ln(b) = ln(b^a) ?
I don’t see it as a punctuation issue.
Ian // October 7, 2009 at 11:45 am |
If only the English would learn to punctuate correctly! (Perhaps that’s the root of Al’s misreading of the post…)
dhogaza // October 7, 2009 at 1:38 pm |
No, it just points to my being the one person to actually look at a good dictionary to see what the professionals have to say about it.
I won’t say anything insulting about those who think their own opinion triumphs that of professionals, though, even if there is a strange parallel with those high school-educated people who’ve overturned climate science …
dhogaza // October 7, 2009 at 1:46 pm |
My last note on this dumb subject (I had expected my first dictionary post to put an end to it, fat chance of that):
Kevin McKinney // October 7, 2009 at 1:47 pm |
At this rate, we’ll be needing posts on Differential Indices of Grammatical Solecisms (DIGS.)
Timothy Chase // October 7, 2009 at 4:15 pm |
Al wrote:
Blame Daniel Webster. His prejudice against the English so coloured his views that he deliberately went out of his way to create an American way of spelling English… and caused my poor wife to lose a spelling bee in elementary school as a result. (She grew up on English literature.)
It is also my understanding that while the likelihood of it has been the subject of some exaggeration, at one point at least one colony was considering switching to German.
Igor Samoylenko // October 7, 2009 at 5:01 pm |
Is it not abundantly clear from context what Tamino meant when he said “Disinterested readers beware!” regardless of what you may think “disinterested” really means?
But I am not a native English speaker, so it may be I am missing something subtle here… :-)
Eli Rabett // October 7, 2009 at 6:15 pm |
It’s not surprising that the cross entropy is equivalent to the entropy of mixing for a solution but it is interesting
Adrian Burd // October 7, 2009 at 8:47 pm |
Timothy,
“Blame Daniel Webster”
I think you mean Noah Webster, his cousin.
Adrian
dhogaza // October 7, 2009 at 8:54 pm |
Yeah, but actually he was trying to regularize spelling so it would be more phonetic.
Getting rid of “ou” when it’s not pronounced as in “our” or “hour”, for instance (thus “color”).
Only a few of his innovations stuck, but they were systematic and not due to “prejudice”. They were meant to make it easier to learn proper spelling by making spelling more … proper :)
Take spanish, for instance, if you hear it pronounced (and know the accent, i.e. Mexico vs. Spain) you can almost always spell it correctly.
While English … ummm … not so true. Webster’s motivation was reasonable.
george // October 7, 2009 at 11:05 pm |
In the process of minimizing the cross-entropy, aren’t you essentially finding the “true” probability distribution? (or at least something close to it)
I assume such a minimization approach works for cases that are more involved than the trivial coin toss case above -, though I can also appreciate that it may not be feasible for some cases.
Are their particular classes of models for which this is true?
Is there some test to determine whether the approach is applicable?
David B. Benson // October 7, 2009 at 11:41 pm |
george // October 7, 2009 at 11:05 pm — Patience. Subsequent parts on this topic will clarify.
ekzept // October 7, 2009 at 11:50 pm |
I wonder if d/dθ of the cross-entropy might not have a useful interpretation? Is it something like the information lost or gained by improving knowledge of θ?
suricat // October 8, 2009 at 1:06 am |
Tamino: I think ekzept has a point!
Where does ‘enthalpy’ feature in this?
Best regards, suricat.
Mark // October 8, 2009 at 10:39 am |
“In the process of minimizing the cross-entropy, aren’t you essentially finding the “true” probability distribution? (or at least something close to it)”
To my rough understanding, the removal of cross-entropy will remove double-accounting for errors.
I.e. if two dependent values are assumed incorrectly to be independent, the error range you get will be sqrt(2) times bigger than the “real” error range in your dataset.
And of course, assuming that the independent values are dependent has the opposite effect.
This error will also change the possible forms of probability distribution, since you’d be mixing shapes of distribution together.
Mark // October 8, 2009 at 10:42 am |
From what I remember from English history and the development of language, the American spelling is an older form of the english spelling and, to that extent, is more “English” than the english spelling.
The two countries had the same spelling and then England went through one rationalisation of the spelling of english words, making a closer tie to the French (hence the appearance of “u” in colour). The american organisation of US spelling was much less radical.
There have been attempts to make the US spelling even more phonetic, but that failed. It did give rise to a long internet joke about spelling, though…
Ray Ladbury // October 8, 2009 at 1:27 pm |
Ekzept and Suricat,
My guess is that you will see some more development in subsequent entries. Keep in mind here that we are talking about the cross entropy over a space of different possible models–which will in general be a lot more complicated than the coin-flip example Tamino used for illustration above. As such, while the entropy is well defined, other thermodynamic quantities (pressure, chemical potential, even temperature) may not have obvious analogies.
I’ve thought about this question somewhat. It seems to me that such thermodynamic analogues might be useful in defining the “best model” subject to some constraints–such as cost or finiteness of resources. In essence, any additional terms that we add will tend to bias the solution away from the “true” model and toward a model that is optimal in some other criterion. The temperature, pressure and chemical potentials would serve as weights for each criterion. The problem would be to come up with a way of doing so that was not arbitrary.
suricat // October 8, 2009 at 10:51 pm |
Ray Ladbury: It seems to me that, like myself, you are also looking for ‘atractors’. OK, let’s wait and see.
Best regards, suricat.
Ray Ladbury // October 9, 2009 at 12:57 am
Suricat,
My interest in this issue derives from its possible application in finding an optimal model for prediction in the face of constraints like finite resources, data, etc. For instance, one could perhaps view a unit-test cost as a sort of chemical potential and the “temperature” as the cost of an error in model determination. Still not sure what the analogue of pressure or volume might be.
Keep in mind, though that there are at least three types of entropy (thermodynamic, information and model), and the relations between them are not 100% understood.
dhogaza // October 8, 2009 at 1:35 pm |
Rather than trusting to memory, one can look stuff up …
These various amateur hypotheses we’re being exposed to are interesting, but really, it’s written down.
Mark // October 8, 2009 at 2:17 pm |
“These various amateur hypotheses we’re being exposed to are interesting, but really, it’s written down.”
What, though, is the spelling…
Mark // October 8, 2009 at 2:45 pm |
“the few -re endings in British spelling (centre, metre, litre, manoeuvre) became -er (center, meter, liter, maneuver)”
Though a water meter is meter not metre.
dhogaza // October 8, 2009 at 3:30 pm |
Sammy J, in his dictionary which fixed most modern British spellings: colour.
Afterwards, in the US, and codified by Noah Webster: color.
That should’ve been clear with a close reading of the resource I pasted above.
ekzept // October 9, 2009 at 3:18 am |
So, can we calculate the K-L divergence of different spellings across countries for the same language?
Barton Paul Levenson // October 9, 2009 at 9:23 am |
The actual, proprt spelling of color/colour should be “ghoti.”
Ray Ladbury // October 9, 2009 at 11:42 am |
Count so far: 45 posts. 23 off topic. Perhaps we could move the discussion of the common language that separates the US from Britain to Open Thread.
[Response: Good idea.]
Kevin McKinney // October 9, 2009 at 12:22 pm |
BPL, you’ve hooked me. . .
(OK, for those who missed the reference:)
Kevin McKinney // October 9, 2009 at 12:24 pm |
Sorry about that link; but follow the connecting links–the story is there on Wiki.
ekzept // October 9, 2009 at 2:41 pm |
Proof of a special case of Akaike’s Theorem.
ekzept // October 9, 2009 at 2:45 pm |
(Hmmm, post failed. Retry.)
“How to Tell when Simpler, More Unified,
or Less Ad Hoc Theories will Provide
More Accurate Predictions”
Aaron Lewis // October 12, 2009 at 8:17 pm |
Be very glad that you can study under Tamino (with his wife’s clear transcriptions) rather than under some earlier generation (George Gamow comes to mind)) with their heavy accented lectures in some changing mix of languages with crude scrawls on a black board.
ekzept // October 13, 2009 at 5:13 pm |
Another reference:
K.P.Burnham, D.R.Anderson, “Kullback-Leibler information as a basis for strong inference in ecological studies”, WILDLIFE RESEARCH, 2001, 28, 111-119
Ray Ladbury // October 13, 2009 at 7:23 pm |
ekzept, Thanks. This was the sort of summary I was looking for a colleague. General and broad, but still informative.
Timothy Chase // October 13, 2009 at 7:42 pm |
ekzept wrote:
I am a little out of my depth here — perhaps more than a little. But you have managed to peak my interest: the paper argues that Kullback-Leiber bears on the application of the Occam’s Razor to scientific theories — and as such to issues regarding the philosophy of science — in what is essentially an alternative to Bayesian inference. (pg. 114)
*
As such it would even bear upon the issue of “What is knowledge?” In essence, the all “theories and models are wrong but some are better than others” means essentially that all theories and models are simply approximations — that we can expect to improve upon over time.
In much the same way, when I say that two animals, say a beagle and a doberman are both “dogs,” in essence I am saying that they are both the same “kind” of animal. But this is simply an approximation, and with a finer grid of concepts I acknowledge that one is a “beagle” and another a “doberman.”
But this is still an approximation. And conceptual knowledge will always be an approximation as it cannot grasp things in all their particularity, whether at the level of everyday discourse or our most advanced scientific theories.
*
In fact, the authors seem to be suggesting that based upon Kullback-Leiber, one can attempt a kind of a middle way between frequentist and Bayesian approaches which combines insights from both while avoiding their respective weaknesses.
Another point this might have some bearing on: why multi-model means of single model ensembles tend to do better than even the best single model ensembles. See page 115. Something which Gavin has remarked on more than once.
Ambitious work — and certainly more than I would have expected from ecological studies, at least at this point. But then they are trying to lay the foundation for “deciding” between alternative theories in a field where I suspect this is often quite difficult.
ekzept // October 13, 2009 at 9:49 pm |
@Timothy Chase,
There is a treatment of the Raven Paradox using the Akaike frame given by Forster which illustrates how the K-L kind of approach addresses what is considered a classic Bayesian win.
Ray Ladbury // October 13, 2009 at 9:55 pm |
Timothy, the fact that the K-L information turned out to be related to the likelihood was a very cool development. Likelihood plays a role in nearly every school of statistical inference–be it Bayesian or frequentist.
There are some who have even argued that likelihood is THE fundamental quality for comparing different models/theories. K-L and AIC extend that way of looking at things.
The Occam’s razor analogy of course stems from the form of AIC, which has a term proportional to the likelihood (a measure of goodness of fit) and the penalty term in the number of terms in the model. Since likelihood enters into the picture as a log term, goodness of fit must actually increase exponentially with model complexity to justify the added complexity. Pretty cool, really. Burnham and Anderson have a pretty good book on the subject.
David B. Benson // October 13, 2009 at 11:26 pm |
Timothy Chase // October 13, 2009 at 7:42 pm — Actually, up to advances 5 & 6, this is just a restatement of (the modern formulation) of Bayesian reasoning. The meme is
MaxInt == Bayesian
See E.T. Jaynes’s “Probability Theory: the logic of science”. Comes with many important recommendations.
ekzept // October 14, 2009 at 1:17 am |
If one wants to get philosophical, the other way of looking at this is to say AIC or the Bayesian Information Criterion replace Occam’s Razor, being quantitative. After all, how does one really know when something amounts to a “simpler explanation”? That’s like the old “law of the unspecialized” in biology: Which species are “unspecialized”?
Timothy Chase // October 14, 2009 at 2:39 pm |
ekzept wrote:
In my view, “refine” might be better than “replace.” Despite the differences in terms of languages in which they are expressed, much of the knowledge which exists in Newton’s gravitational theory is preserved in Einstein’s gravitational theory. In a sense, this is the meaning of the principle of correspondence. Regarding the difference between qualitative and quantitative reasoning, qualitative generally precedes quantitative.
First you recognize that two entities are “different,” that is, “different” in relation to one another. But bringing in another object, and one object may appear similar, that is, of the “same” kind as the second as the differences between between the first and the second recede into the background whereas the differences between the first and the third are brought into the foreground. And it is only then is one able to conceive of two units of the same kind and thus of quantitative measurement.
*
ekzept wrote:
Clearly AIC/BIC would be an improvement on Occam. In some contexts Occam can easily and non ambiguously be applied, such as when two explanations are equally good at explaining all of the evidence but one is considerably more convoluted, involving more entities or assumptions that the other. But this is something we more or less take for granted nowadays, and in the areas where we need additional guidance some sort of improvement upon Occam’s Razor is required.
*
ekzept wrote:
I believe what you may be getting at here is that “unspecialized” is in fact a comparative concept rather than an absolute one. Something is large only in comparison to something else that is small.
As for the “law of the unspecialized” being antiquated, I see that it dates back to 1896. However, Stephen J. Gould regarded it as an insight of sorts as it forms the basis for a higher level selection.
Furthermore, one species may very well be unspecialized — when compared with another. But of course the “law” would be more of a “rule” rather than an inviolable law. Biology.
ekzept // October 14, 2009 at 5:18 pm |
@Timothy Chase ,
While Newton may fit the same date as relativity, the equations and conceptual frames are vastly different. And, if that’s not sufficiently different to click acknowledgement from you, surely the frame of quantum expectations are another notion, another qualitatively different world from the classic means of calculating, say, the hydrogen atom.
One way a law or rule can fail to be falsifiable is if its terms are too ambiguous for someone to definitively know whether or not it applies.
Timothy Chase // October 15, 2009 at 3:02 am |
ekzept wrote:
I believe that is “data” and “conceptual framework.” In any case, Newtonian gravitational theory can be expressed in terms of the language of curved spacetime — where the curvature exists strictly between the spatial dimensions and temporal dimension. Likewise, so long as the spacetime that is a solution to Einstein’s field equations is topologically equivilent to an extended Riemannian pseudo-sphere, one may replace the curved spacetime by a flat Newtonian three plus one dimensional spacetime and gravitational fields.
*
ekzept wrote:
Qualitatively different? Surely. And as a matter of fact with our understanding of classical physics electrons would continuously emit electromagnetic energy and spiral into the nucleus of their respective atoms within a small fraction of a second — if classical physics held at that level. But we also know that at some level the equations of quantum mechanics and general relativity will break down, either one, the other or both. In all likelihood the language of one, the other or both will have to change as a result. Does this mean that they do not apply? They apply over the range over which they are applicable.
The reason why one wouldn’t express Newtonian gravitational theory in terms of a curved spacetime with no gravitational forces is not because it would be false or because it would be any less accurate than Newtonian gravitational theory with a flat spacetime and gravitational fields but due to the consequent complexity of the equations and the difficulty in applying them — not whether or not spacetime is in fact curved. (This sort of argument likely applies to General Relativity as well — insofar as topologies that differ from an extended Riemannian pseudo-sphere may be physically unrealizable or, if physically realizable incapable of scientific verification.)
In the same way that climatologists are often found of saying that all models are false, but some are useful, one may also say that all scientific theories are false, but some are useful — and some are more useful than others — over larger domains, or due to the ease with which one may apply the equations in the required context.
*
ekzept wrote:
I take it that you are referring to the ambiguity (outside of a given domain) of Occam’s razor that I referred to. Of course another way that a principle or theory may fail to be falsifiable is by being unfalsifiable — such as with a prioristic reasoning.
So much for AIK:
However, even as Popper saw it, not all knowledge is necessarily falsifiable. Ethical, aesthetic or theological statements, for example. Likewise the norms which define scientific discourse might very well be untestable — in the sense that they are used to define what it means for a scientific theory to be testable. However, falsifiability is a criterion that the philosophy of science gave up some time ago due to the interdependence that exists between scientific theories.
Please see:
Do Scientific Theories Ever Receive Justification?
A Critique of the Principle of Falsifiability
*
In any case, I thank you for bringing to my attention the papers on AIK and I look forward to your participation in their discussion. I believe it is quite likely that I will learn more as a result. And as a matter of fact, I either was never aware of the raven paradox you brought up, or if in fact I had been at one time, I forgot. And I have yet to wrap my brain around how it is resolved by AIK. No doubt like you, I wish to understand things and oftentimes the first step in understanding is the recognition that one still has things to left to understand.
ekzept // October 15, 2009 at 5:58 pm |
@Timothy Chase,
Yeah, that can be done, but that certain is not how Newton — or 19th century physics — thought about the problem. Sure, I understand entirely that the better model has to fit the older one, which is a special case.
Presumably there are “residuals” between what models predict and what the data shows, although for as far-reaching a model like relativity and quantum, it’s hard to imagine a single such depiction. I would also say, and any model selection process really ought to consider this, too, that a theory which is no more accurate than quantum but also no less accurate yet is computationally simpler to execute is a superior model.
I don’t see your point here. If “all models are false, but some are useful” (from statisitician G.E.P. Box, BTW), surely there is a possibility that a “combination of models” may serve as a useful model. The thing is, physicists and our collective notion of reality balks at the idea of having Keplerian ellipses and Ptolemaic epicycles both being true. I think that’s more our problem than one of the models’.
The trouble is that traditional logic as used and as far as I know cannot model iteratively convergent methods for finding truth, even if these are qualitative. These are used all the time in science, and not only in numerical methods. For example, the determination of ages of geological strata depend upon multiple techniques and mutually constrain one another, with ties to findings from other strata elsewhere which, by circumstance, are better constrained in various ways. This is something people outside the field often founder upon, but it is entirely legitimate.
I don’t think the Anderson AIC “resolves” the paradox, but offers an explanation as compelling as the Bayesian one.
Timothy Chase // October 17, 2009 at 6:54 am |
Science and Philosophy, Part I
Regarding my observation that either Newtonian gravitational theory or Einstein’s gravitational theory may be expressed either in terms of a flat spacetime with gravitational fields or a curved spacetime in which gravitational fields have been eliminated, ekzept wrote:
Agreed. Even today I believe one would be hard-put to find an engineer who prefers to perform calculations using Newton’s gravitational theory as it would be expressed within the language of curved spacetime rather than flat spacetime plus gravitational fields. Engineers use the traditional language in which it is expressed because the concepts, equations and calculations are simpler in the traditional language of Newton’s gravitational theory.
However, if one could more easily and readily solve engineering problems by employing the language of curved spacetime I doubt that it would be very long before engineers regarded flat spacetime as some sort of bad dream. Flat spacetime with gravitational fields is the language (form) in which Newtonian gravitational theory can be most simply expressed, whereas curved spacetime without gravitational fields is the language in which Einsteinian gravitational theory can be most simply and economically expressed.
ekzept wrote:
As I understand it, the problem isn’t so much with a lack of correspondence between theory and evidence at this point. There is just about always one experiment or another which suggests as much until the results are overturned a few years later. But there exists a great deal of difficulty reconciling the twotwo theories with each other – despite their having proven exceedingly accurate in their respective domains.
Integrating the insights of quantum mechanics with those of special relativity is not especially problematic. Integrating the insights of quantum mechanics and general relativity however is. When one studies the evolution of a wave function or probability density operator, one does so against the backdrop of a spatial geometry that is well-defined.
But what does one do when the evolution geometry of spacetime becomes probablistic — and how would one express a theory of such an evolution? When the very concept of geometry begins to fall apart as one nears the Planck-Wheeler level?
*
ekzept had written:
I responded:
ekzept then responded:
I wasn’t thinking so much of the multimodel approach as the simple fact that AIK itself is presumably a prioristic in nature, at least according to the abstract that I then quoted, with the most relevant sentence being:
If it is “a prioristic” then it is no more falsifiable than Occam’s razor — and the principle of falsifiability cuts both ways. But the fact that both principles are essentially normative in nature would suggest that they are not theories to be tested but rather are elements in the framework through which one defines what it means for scientific theories to be testable — like the principle of falsifiability itself — which presumably is itself unfalsifiable.
However, as I pointed out, Popper’s principle of falsifiability presupposes that scientific theories can be tested in isolation. Given the interdepedence that exists between scientific theories we know that this assumption is false and thus the principle of falsifiability must and has been abandoned by the philosophy of science — essentially since the 1950s. And the theoretical basis for its abandonment was more or less understood as far back as the 1890s, roughly forty years before the principle of falsifiability was first formulated.
Please see:
A Critique of the Principle of Falsifiability
As such there are a variety of reasons why I would regard the lack of falsifiability for either Occam’s razor or AIK irrelevant to either. However, I myself would go even further and abandon the concept of the a priori along with the analytic/synthetic dichotomy.
Please see:
Something Revolutionary: A Critique of Kant’s The Critique of Pure Reason
Section 25: Self-Reference and the Analytic/Synthetic Dichotomy
Timothy Chase // October 17, 2009 at 6:56 am |
Science and Philosophy, Part II of II
ekzept wrote:
I would essentially agree, although the way that I would put it is not that the “all models are false” as that would be in my view a colloquialism, but rather that all models (or theories) are approximations. Likewise, presumably with time we could improve upon the models, some will drop away perhaps to be replaced. But for the time being at least, each does some things better than others — otherwise it would have already fallen away — and given the law of large numbers, the average is closer to that which each is an attempt to model than any of the models that go into the average.
*
ekzept wrote:
If by “traditional logic” you mean “formal logic” (either categorical or propositional) then no, I wouldn’t expect to find any “iteratively convergent methods for finding the truth” there. However, there has there has been a convergence of sorts in epistemology with respect to theories of justification between coherentialism and an empirical foundationalism towards what may be termed a “coherentialist moderate foundationalism.” Or at least this is what Robert Audi proposes in “Fallibilist Foundationalism and Holistic Coherentialism.”
This sort of approach acknowledges the fact that multiple, independent lines of evidence are often capable of transmitting far greater justification to a given conclusion than any one line of evidence in isolation. Likewise, some element of coherentialism would seem to follow in recognition of Duhem’s thesis first put forward during the 1890s. And consistent with moderate foundationalist elements, knowledge would consist primarily of corrigible knowledge — where justification is always a matter of degree.
This would lend itself to what is sometimes termed “social epistemology” (e.g., which might study such things as dialogue and debate, and at an abstract level at least the division of cognitive labor. The philosophy of science would be a branch of this. Then under the “philosophy of science” exists the study of “the” scientific method – which would address such questions as whether there is even any one single scientific method — or whether there are different scientific methods for different sciences. Presumably when Burnham and Anderson state, “Information-theoretic approaches emphasise a deliberate focus on the a priori science in developing a set of multiple working hypotheses or models,” at one level or another, they are dealing with issues related to the philosophy of science.
*
ekzept wrote:
Certainly one of the things I find most beautiful about science. And although I use other examples, I believe I have done a fair job of illustrating just this sort of interdependence in the piece I linked to earlier critiquing Karl Popper’s principle of falsifiability — and thereby illustrating Duhem’s thesis. In case you are interested, that piece belongs to a ten part paper of mine that aims at providing a critical history of early twentieth century empiricism which I have made available here:
A Question of Meaning
ekzept // October 17, 2009 at 2:24 pm |
Something I learned years after graduate school is that the embrace of a new Kuhn-type frame is not a perfect or consistent improvement. When Newtonian — per perhaps better put, Lagrangian — astronomy is displaced by curved space-time, there are things and insights which were deep and convenient which are lost. They are outweighed, however, by the greater accuracy of the new.
Similarly, the advent of computational models has ushered in a new paradigm with many benefits, but there are deep insights and economies to be had using traditional, difficult mathematics, even if these are aided by creatures like Mathematica.
I am interested, but I’m afraid I have not the time. In addition to learning many new things about maths — which always goes slow — I’m wading through the new (and important) Reinhart & Rogoff book This Time Is Different.
Ray Ladbury // October 17, 2009 at 3:58 pm |
Timothy,
The emphasis on a priori science is basically a way to restrict potential theories/distributions/hypotheses that will be considered according to theoretical expectations. For instance, presumably if a quantity is positive definite, we need consider only distributions defined from 0 to infinity, not the entire real line. In essence this is similar to the selection of a family of models for a Bayesian Prior. One selects the best model according to how economically it fits the data or weights the results for different models according to how the same criterion (e.g. Akaike weights). Thus, in the former model scheme a model is falsified when it has negligible support from the data (e.g. delta(AIC)>10) or in the latter case when its weight is sufficiently small that it contributes negligibly to the result. Rather than outright falsification, the scheme is probabilistic, and so probably a better fit for active science as opposed to settled science.
Timothy Chase // October 17, 2009 at 5:26 pm |
ekzept,
Sorry — I hadn’t checked the link you have back to your blog. It looks like you get the chance to do some fascinating work — and it likewise looks like we share some other interests. Photography, for example. And likewise the influence of the Religious Right on American politics, including their attempts to foist creationism in the guise of intelligent design upon the US educational system. Here is one of the responses to Thoughts on the Intelligent Design Inference which you might enjoy — posted at the British Centre for Science Education, an organization that I helped form.
And yes, unfortunately creationism — particularly young earth creationism — has spread with a vengence to other parts of the world, Australia, France, former Eastern Europe, and even the birthplace of Charles Darwin. Likewise the religious right plays a large part in the attacks upon the legitimacy of climate science.
For that particular reason they figure somewhat prominently in a custom Google search engine I have been putting together:
Climate Search
Included among the sites that this search engine searches is:
Notable Names Database
… which you might also like as it contains a tool for visualizing data, relationships and the exploring of networks.
For example, this is the entry they have for:
Howard Ahmanson, Jr.
… who largely financed the Discovery Institute, and this is an example of the sort of network someone has created using the tool for studying the attempt to impose theocracy upon the United States:
Theocracy Now!
… which you might also find of interest some of the links you have at your website. Such as the link to the book “The Eliminationists: How Hate Talk Radicalized the American Right” which you linked to under your blog photos.
Of course the religious right isn’t the only place on our political landscape where one will find hate talk. Given the phenomena of complementary schismogenesis one will find one brand of extremism giving rise to its “opposite” on the other side. (Quite commonplace in history, e.g., communism vs. Nazism in Germany during the 1930s, French Algeria between the French separatists and and French loyalists in the 1950s.) But it would seem to be where hate talk is most pronounced and widespread.
Timothy Chase // October 17, 2009 at 5:38 pm |
Ray Ladbury wrote:
Understood — and actually I regard that sort of a prior approach entirely valid — and in my personal view AIK is quite likely the correct approach. My argument against the “a priori” mentioned above is not in my view an argument against the AIK approach but rather an argument against any sort of criticism based upon the principle of falsifiability. Ultimately, however, I would argue that both the dichotomies between the a priori and a posteriori and the analytic and synthetic are false dichotomies. In fact this is a large part of my argument with both Kant and Logical Positivism.
Timothy Chase // October 17, 2009 at 6:06 pm |
ekzept wrote:
I would most certainly agree. As a matter of fact, one of the attacks on the general legitimacy of science is grounded in a relativistic approach that is greatly indebted to Kuhn, one proponent of which is…
Steve Fuller
An element (one of several) in the response to this sort of an approach would be found in:
A Question of Meaning, [6]: The Criterion of Self-Referential Coherence Vs. Logical Positivism, [6.1] The Criterion of Self-Referential Coherence applied to Radical Skepticism
… as would:
A Question of Meaning, [10]: Against Q.V. Quine and the Analytic/Synthetic-Dichotomy
*
ekzept wrote:
I would most certainly agree. Then again there are some unexpected insights that are preserved, such as the absence of a gravitational field throughout the inside of a uniform empty spherical shell of constant density.
*
ekzept wrote:
I have no reason to think otherwise — despite some of my arguments with Russell — such as those involving self-referential logic. I believe that one should always be open to learning from those that one disagrees with. There are often insights which combined with one’s own can be very illuminating. This is the power of dialogue. And, borrowing from “Babylon 5,” I find that there is much value in the view that,
“Truth is a three-edged sword: your side, their side and the truth.”
*
ekzept wrote:
Understood. Likewise, I would have included my critique of Kuhn and what came after in a broader version of “A Question of Meaning” if I had had the time, but as Morpheus says in The Matrix, “Time is always against us.”
Timothy Chase // October 17, 2009 at 6:11 pm |
PS
Correction:
“Truth is a three-edged sword: your side, their side and the truth,”
… should have been:
“Understanding is a three-edged sword: your side, their side and the truth.”
Timothy Chase // October 18, 2009 at 12:52 am |
Not quite the Akaike information criterion, but something I ran into a few years back that may be of interest…
Barton Paul Levenson // October 18, 2009 at 11:12 am |
Falsifiability works for me. Yes, if theory A predicts Jupiter should be bright green and it turns out to be orange, you can’t absolutely rule out theory A yet, because something might be masking the greenness, or it might have been green in the absence of some extra factor. But using Occam’s Razor, you can put those ideas aside at least provisionally. Falsifiability plus Occam’s Razor seems like an excellent working combination to me, even if neither technically works by itself.
Timothy Chase // October 18, 2009 at 6:03 pm |
Falsifiability and Simplicity, Part I of II
Barton Paul Levenson wrote:
I sometimes come off as sounding like I see no value in the “principle of falsifiability,” but that really isn’t the case, and I have stated as much before in a somewhat informal essay…
Falsifiability is something to be aimed for, but in my view, particularly with the more advanced scientific theories, it is difficult if not impossible to achieve. The reason being is that no scientific theory stands or falls in absolute isolation from the rest. We can see suggestions of this in the attempt to rescue Newton’s theory with a hypothetical planet to explain the orbit of Uranus (prior to the discovery of Neptune) or a hypothetical planet Vulcan to explain the orbit of Mercury (or alternatively appeal to unobserved oblateness of the distribution of mass within the sun).
In either case, the additional “auxiliary hypotheses” were appropriate responses — so long as one sought to make them independently testable of the hypothesis or theory that they were proposed to save. (When they aren’t independently testable they are refered to as ad hoc hypotheses.)
The possibility that a theory might be properly “saved” by means of an auxiliary hypothesis (hypothesizing an additional planet in order to reconcile Newton with the orbit of Uranus — prior to the discovery of Neptune) or improperly “rescued” by means of an ad hoc hypothesis (what could have happened given the divergence between Newton and the precession of Mercury’s orbit if scientists had been unwilling to test or relinquish the hypothetical planet Vulcan as a means of explaining that precession) indicates the beginning of this, but it is only the beginning.
Almost inevitably, in any test of the theories of modern science one must presuppose certain premises or more well-established theories of science in order to test the theory that one seeks to test. One must presuppose that these premises are already established or true, because in logic the result that one predicts on the basis of theory that one seeks to test isn’t simply dependent upon the theory itself but on a variety of background assumptions, and if the prediction turns out to be false, then one does not know that the theory itself is false, but only that at least one of the premises which formed the basis for that prediction was false.
I offer an extended example of this here — involving evolution and the reasons why 19th Century science regarded it as unlikely that the earth was old enough for evolution to explain the origin of the earth’s many species of life:
A Critique of the Principle of Falsifiability
Timothy Chase // October 18, 2009 at 6:05 pm |
Falsifiability and Simplicity, Part II of II
Barton Paul Levenson wrote:
Agreed. One discounts the theory and the hypothesis proposed to save it — until such time as one is able to propose a means of independently testing the hypothesis. Without such a test the proposed hypothesis is ad hoc, and it becomes “auxiliary” only once it can be tested independently of the theory it is intended to save. But if one is setting aside the theory “only provisionally,” then strictly speaking it hasn’t actually been falsified. And as such, given the interdependence of our scientific knowledge validation (e.g., induction) and falsification is always a matter of degree, that is, either a form of confirmation or disconfirmation. In which case I would argue that it is entirely appropriate to regard a well-supported and well-established theory as being true and consequently as a form of knowledge — provisionally — that is, as a form of corrigible knowledge.
*
Barton Paul Levenson wrote:
If I understand things correctly, this is essentially what Akaike Information Criteria does — but rather than doing so simply in terms of a qualitative language where a either receives confirmation or disconfirmation or where an additional hypothesis is either auxiliary or ad hoc — it does so quantitatively.
Please see for example Ray Ladbury’s statement above:
… as well as of course the essay by Tamino itself.
And as Ray Ladbury states later, this ability to quantify the reasons for regarding a given theory as “confirmed” or “disconfirmed” is a strength where science is still active or in flux:
… which is afterall precisely where you would want some sort of guidance from a principle of scientific method. If the science is already well established there isn’t much call for guidance, is there? When he states, “One selects the best model according to how economically it fits the data…” this is in essence where the insight from Occam’s razor (or alternatively, the “rule of simplicity”) is preserved but is given mathematical form.
ekzept // October 18, 2009 at 7:57 pm |
There are many other problems with a strictly Bayesian approach to things, including the need to be unnecessarily precise in a specification of an initial prior: Sure you might guess that there are 3 ranges of possible values for a prior, with each lower one being about twice as probable as the next one up, but you might not [i]really[/i] know it’s twice as probable, simply think its between 25% and 300% more probable as the next one up. Bayes [i]makes you have to specify[/i] and has no organic means of passing on this uncertainty into your inference.
Timothy Chase // October 19, 2009 at 2:31 am |
For those who are interested…
Two Bayesian Defenses in response to AIC:
Two Papers on AIC, Curve-Fitting and Grue…
Timothy Chase // October 19, 2009 at 2:52 am |
With registration, free access to full text until October 31, 2009:
Jouni Kuha (2004) AIC and BIC: Comparisons of Assumptions and Performance, Sociological Methods & Research, Vol. 33, No. 2, November 2004 188-229
Timothy Chase // October 19, 2009 at 6:12 am |
Two more comparisons that may be of interest that are open access…
Michael E. Alfaro and John P. Huelsenbeck (2006) Comparative Performance of Bayesian and AIC-Based Measures of Phylogenetic Model Uncertainty, Systematic Biology 55(1):89-96
Russell J. Steele, Adrian E. Raftery (Sept. 2009) Performance of Bayesian Model Selection Criteria for Gaussian Mixture Models, University of Washington Department of Statistics, Technical Report No. 559
The last of these compares the performance of several different criteria, including
BIC (Schwarz 1978), ICL (Biernacki, Celeux, and Govaert 1998), DIC (Spiegelhalter, Best, Carlin, and van der Linde 2002) and AIC.
Barton Paul Levenson // October 19, 2009 at 11:00 am |
Well then, let me say that a theory can be “effectively falsified” or “essentially falsified.”
BTW, did you guys know that in addition to the Akaike Information Criterion, there is the “Corrected Akaike Information Criterion” and the “Schwarz Information Criterion,” all of which sometimes give different answers? The multiple regression program I wrote gives all three so you can use whichever one you want.
Ray Ladbury // October 19, 2009 at 2:24 pm |
ekzept,
For a very practical and cogent formulation of the Bayesian approach, see E. T. Jaynes’s Probability: The Logic of Science. In many ways, information theory and Bayesian approaches are complementary. Indeed, there is no reason why one must choose only a single Prior–one can compare the performance of different Priors and select the one that performs best or even average over Priors.
The whole issue of falsifiability is an interesting one. Science has become increasingly probabilistic as we have started to understand how errors propagate. Even so, at some point, a theory becomes so improbable that we cease to consider it. In effect, our “Prior” as repeatedly updated with evidence would have effectively zero probability. Helen Quinn argued in a Reference Frame Column in Physics Today, that at some point, evidence in favor of a theory would become sufficiently strong that it could be considered established fact–probability effectively 1. Of course, this is contingent upon the results of all subsequent experiments, but unless we find that “The Matrix” is history rather than fiction, we can be pretty confident that Earth is round and orbits the Sun.
Finally, wrt the different information criteria, (AIC, B/SIC, DIC), one can also look at likelihood itself. In effect one can view these different criteria as applying different weights to goodness of fit vs. model complexity penalty–and for AICc amount of data. So, if you want to get really speculative, you can ask how the cross entropy (or even Shannon Entropy) relates to a thermodynamic entropy. And even further out–what corresponds to “energy” “temperature”, etc.
Timothy Chase // October 19, 2009 at 4:04 pm |
Barton Paul Levenson wrote:
Hmmm…. That may work.
*
Barton Paul Levenson wrote:
I believe I might have run across something to that effect. Well, not the “Corrected Akaike Information Criterion” as of yet, but there were others.
Akaike and Schwarz tend to give similar answers, but Schwarz tends to do better by various criteria — homing in on the model that best fits the data, suggesting fewer parameters, etc.. Michael E. Alfaro and John P. Huelsenbeck (2006) state at one point in their abstract that, “The AIC–based credible interval appeared to be more robust to the violation of the rate homogeneity assumption,” but for the most part they seem to lean toward the Bayesian Information Criterion proposed by Schwarz.
Jouni Kuha (2004) suggests that, “… useful information for model selection can be obtained from using AIC and BIC together, particularly from trying as far as possible to find models favored by both criteria.” Russell J. Steele and Adrian E. Raftery (Sept. 2009) come down rather strongly on the side of the Bayesian Information Criteria — but this seems to be in an area where BIC was already thought to perform better than AIC.
But I limited my reading mostly to the abstracts. Mostly. My main objective was simply to find articles that had something to say regarding AIC and BIC, both vs. and in relation to.
*
Barton Paul Levenson wrote:
Oh? What language is it written in? I will probably just stick with Excel — that makes me blunderingly dangerous as it is — I believe arctic ice might ring a bell…. But I am still curious.
Deep Climate // October 19, 2009 at 4:32 pm |
I was wondering when BIC would come up.
I noted this passage on climate sensitivity in the CCSP 5.2, p.67:
An interesting informal comparison of AIC and BIC is here:
Enjoy!
Deep Climate // October 19, 2009 at 4:36 pm |
As to how BIC has been used in climate studies, CCSP continues:
David B. Benson // October 19, 2009 at 10:21 pm |
Deep Climate // October 19, 2009 at 4:32 pm — Thanks for the link! That was fun and informative!
Timothy Chase // October 20, 2009 at 2:03 am |
Ray Ladbury wrote:
Ray, actually I believe that might be:
Probability Theory: The Logic of Science
by E.T. Jaynes
Just a hunch.
hipparchia // October 20, 2009 at 2:05 am |
de-lurking to thank mrs tamino for typing this for us.
Barton Paul Levenson // October 20, 2009 at 10:46 am |
Tim,
I’m ashamed to say I wrote it in Just Basic, which is an interpreted language. I wanted a GUI interface, and while my Fortran compiler is supposed to provide one, I never really learned how to use it. (I mainly use Fortran for writing RCMs in console mode.) I should probably rewrite the whole thing in Fortran some time.
Timothy Chase // October 20, 2009 at 4:32 pm |
Barton,
My now-deceased permanent position was as a VB6 programmer for five years. So I don’t look down on visual basic. However, I have a friend I worked for more recently who managed to keep a temp job at Boeing for as long as my “permanent” job. And at this point, VB6 is in roughly the same position as Sanskrit.
But if you were going into DotNet, C-sharp would be the way to go. VB.Net seems to have been mostly a bridge to the world of DotNet, and DotNet job growth will be mostly in C-sharp from now on. And while there are fewer C-Sharp jobs relative to Java, the demand for C-Sharp (being new, I suppose) is expanding much more rapidly.
Then there are the other C-languages. Javascript, PHP, ActionScript and so on. Learning any one of them gives you a leg-up on the rest. So that is where I am focusing.
Plus C-Sharp is incorporating functional-language and query-language features. I can only assume Java is doing the same. (But of course C-Sharp came after the object-oriented revolution in programming and has consistently incorporated its principles. Java can’t quite claim the same.)
I know Fortran is what gets used the most in climatology, but in the long-run, code-reuse and all, it might be a good idea if they started moving to C-type languages — or at least using them more often.
Deep Climate // October 20, 2009 at 6:29 pm |
I have written programs for part or most of my living at various times (still do, but it is quite peripheral now).
I consider C++ and Java full-fledged OO languages. AFAIK, Java was designed as an implementation of OO principles, but I’m not a software historian. I can’t comment on C#, although part of me recoils at platform-specific languages.
It seems to me all three must have baggage inherited, so to speak, from C.
As far as I can see, Matlab seems to be the current choice for statistical analysis in climate research (e.g. Mann et al 2008). It has a huge advantage over R in that it is comilable.
I agree that a migration away from Fortran (e.g. in climate data processing, or climate models) could be helpful, but there’s probably a lot of legacy data processing code that would need to be rewritten from scratch.
suricat // October 21, 2009 at 12:19 am |
If you use a compiler then the only other addition you need to include any other computer language is a translator!
The problem with this is that the translator uses up so much of the ‘run time’ making its comparisons that the ‘other languages’ aren’t justifiable due to the increased ‘run time’.
I’ve seen a lot of this problem in the GCMs that I’ve looked at, but, so what if the code needs to be rewritten in the name of shorter run times.
Best regards, suricat.
dhogaza // October 21, 2009 at 3:44 am
I worked much of my early professional life as a very highly-regarded compiler writer …
And you’re full of shit, though your note is so convoluted I can’t say exactly how.
dhogaza // October 21, 2009 at 3:46 am
“I’ve seen a lot of this problem in the GCMs that I’ve looked at”
Name them, give URL references to the code, and then prepare to be bitch-slapped by people who know what they’re talking about.
Deep Climate // October 20, 2009 at 6:30 pm |
Oops, “comilable” should be “compilable”
Timothy Chase // October 20, 2009 at 9:55 pm |
Deep Climate wrote:
I don’t know that much about Java as of yet.
But there is Mono for the Linux world. The specifications for C# are public, and as such you can create open source versions of C# that are fully compatible with DotNet — or even port DotNet to the Linux world. Mono is the result of one such endeavor.
Some details:
It is also my understanding that Microsoft has been developing their own port to Linux, but I don’t know as much about that.
However, just as Java is(? or at least was last I checked) slower than C# on most tests typically by factors of 2 to 3, Mono is slower than Java — last I checked. Roughly by a factor of 2 if I remember correctly. Nevertheless, it has been winning awards.
Personally I think Microsoft may have already seen its better days, but C# is something special. Then again I grew up on Microsoft. Still, I am picking up other C-family languages.
Timothy Chase // October 20, 2009 at 9:57 pm |
Another paper that may be of interest:
Barton Paul Levenson // October 21, 2009 at 9:59 am |
C-related languages have a couple of problems.
1. All those semicolons, and remembering which lines get them and which lines don’t.
2. No exponentiation operator. This may seem trivial, but in a climate situation, you’ve got equation after equation. It’s a lot easier to write
F = epsilon * sigma * T **4
than to write
F = epsilon * sigma * pow(T, 4.0);
let alone
F := epsilon * sigma * exp(4.0 * ln(T));
And it’s easier to read and figure out as well.
3. All the class and object-oriented stuff is irrelevant to straightforward simulation, since errors can be avoided accurately enough with top-down programming and modular design. You don’t want clever programming tricks and elegant data structures for a simulation, you want speed, speed, and more speed. Fortran beats every other high-level language out there. Only assembly language is faster–and try programming complicated equations in assembler. You’d need about 20 lines to do what I do in one line of Fortran above.
4. Object-oriented stuff involves a lot of concealing information from the programmer who uses your routines–thus inheritance and private variables and interfaces and so on and so on. In science you don’t WANT to conceal your code or your algorithms, and you can assume the users of your code are not idiots who need to be protected from themselves.
5. In C or Java or Pascal/Delphi you need to import units or packages or libraries to get anything not absolutely basic done. In Fortran you don’t. All kinds of math is available as built-in functions, from complex numbers to hyperbolics to Bessels. You don’t have to remember which package has the statistical functions and which has the complex number functions. And it’s extremely rare that you have to write your own.
6. With Fortran modules (or earlier, common blocks), you can easily declare and use global variables. The recent languages frown on global variables as one of those confusing things amateurs might make a hash of, and several of them make it really hard to declare any. But if you’re doing atmosphere physics you WANT nearly every routine to have access to b, c, c1, c2, c3, P0, pi, 2 pi, 4 pi, R, sigma and T0 without having to declare them in each module.
I have written fully functioning RCMs in Basic, C, Fortran, and Pascal, and I prefer Fortran.
More ranting of this sort can be found at
Ray Ladbury // October 21, 2009 at 11:43 am |
Timothy, Regarding your last cite( Casella and Consonni), I wonder if the fact that different information criteria are optimal for different purposes might correspond in some way to the thermodynamic case, where the natural variable is in some cases energy, in others enthalpy…
Inconsistency and worst-case error represent different types of error that might have differential importance for different problems. and the different weights given to model complexity penalty and goodness of fit in AIC and BIC might tend to bias the outcome in the desired direction.
Timothy Chase // October 23, 2009 at 4:41 pm |
Ray Ladbury wrote:
Quite possible. After downloading a copy of Jayne’s book (which unfortunately I haven’t had a chance to get into very deeply as of yet) I see that it is his view that despite the fact that he believes that the debate between frequentist and Beyesian has been largely won by the Beyesians, there are roles to be played by the frequentist approach. (Personally I might like to see some form of complementarity between the two approaches — but that is more a matter of personal aesthetics than anything else.)
I have seen that AIC presumably grows out of a frequentist approach, but then I recently ran across a paper that argued that a frequentist derivation of BIC is certainly possible as is a Beyesian derivation of AIC. And there have been papers that argue either applying both methods in order to achieve the strongest results, and papers that argue that BIC and AIC both have strengths even though according to most criteria BIC performs better.
Anyway, I am looking forward to learning more — but at the moment I have to shift more into a luker-type role due to time constraints mostly due to the demands of school.
Timothy Chase // October 23, 2009 at 5:10 pm |
I had just written:
An example of the former (arguing in essence that the methods work best when used in combination) would be:
Jouni Kuha (2004) AIC and BIC: Comparisons of Assumptions and Performance, Sociological Methods & Research, Vol. 33, No. 2, November 2004 188-229
… which I cited above then quoted in a later comment in part as saying:
(NOTE: open access with registration until 31 Oct 2009)
An example of the latter (arguing that both have strengths, but according to most criteria BIC performs better) was given by me as:
Michael E. Alfaro and John P. Huelsenbeck (2006) Comparative Performance of Bayesian and AIC-Based Measures of Phylogenetic Model Uncertainty, Systematic Biology 55(1):89-96
… of which I stated:
Ray Ladbury // October 24, 2009 at 1:10 pm |
Timothy, Really the only aspect of AIC that is at all “frequentist” stems from its relation to K-L information–that is that the “TRUE” distribution exists and is part of the family of distributions under consideration. AIC, BIC and DIC are all related to the likelihood, and likelihood is fundamental to both frequentist and Bayesian schools. Anderson and Burnham have argued that AIC can be derived from a “savvy Prior” as opposed to a “maximum entropy Prior,” and that we are never in a state of maximum ignorance.
The main difference in the behavior of AIC and BIC arises from the penalty term–2k in AIC and ln(n)*k for BIC, wheren k is the number of parameters and n is the sample size. This makes is much less likely that the favored distribution will change once the sample size is sufficiently large. This has both advantages and disadvantages. If the convergence of the answer with increased data is slow, this may give rise to some odd behavior. In any case, the use of AIC-weighted averages diminishes the importance of “getting the right answer” on distribution form. It is my impression that AIC-weights ought to be better behaved and more intuitive than BIC weights.
Unfortunately, Jayne’s never seems to have embraced model selection/averaging. It would have been interesting to have his take on it. Hmm, anybody got a Ouiji board…
David B. Benson // October 24, 2009 at 10:32 pm |
Timothy Chase // October 23, 2009 at 4:41 pm — Bayesian
Timothy Chase // October 25, 2009 at 7:53 pm |
David B. Benson wrote:
Thank you. Sometimes I spell things they way they sound and pronounce things the way they are spelled. Some sort of issue which also manifested itself in a hand-to-eye coordination problem early in life — if I remember correctly — but the name currently escapes me. I hate being unable to trust my own mind — so of course I was “cursed” with a bipolar condition as well. But at least I will always reach for the red pill…
Phil Scadden // October 27, 2009 at 1:05 am |
Language wars!! Yes. I still maintain half a million lines of Fortran, but sorry, despite being raised in the language, I hate it.
>1. All those semicolons, and remembering >which lines get them and which lines don’t.
Sheesh? Its a pretty simple rule. Much prefer to single-line statements or continuation marks.
>2. No exponentiation operator. This may seem >trivial, but in a climate situation, you’ve got >equation after equation. It’s a lot easier to write
But a potential source of trouble – you will do exponentiation by which method? And if you use a “general” routine, then you pay cost for internal method determination. I still think its a trivial point however.
>3. All the class and object-oriented stuff is >irrelevant to straightforward simulation
Amazing the no. of times you need to use generics though. Actually I really like objects for simulation, but I agree that they get in the way when it comes to a numerical algorithm. No one forces you to use them when inappropriate.
>Only assembly language is faster–and try >programming complicated equations in >assembler.
c is more or less high level assembler. For every apples for apples compiler test, I would bet on C winning over fortran.
> You’d need about 20 lines to do what I do in >one line of Fortran above.
This could only be a reference to f90 or f95 array syntax.
> In science you don’t WANT to conceal your >code or your algorithms, and you can assume
I think this is a misunderstanding of data hiding. You are writing to avoid inadvertent manipulation o f variables and to enforce rules. No algorithms are hidden at all – far from it.
> And it’s extremely rare that you have to write >your own.
Likewise in C++. Unless you want more than the standard provides or faster code because you know that the data has attributes that allow faster methods.
Including the maths library is hardly a chore.
>6. With Fortran modules (or earlier, common >blocks), you can easily declare and use global >variables.
Common blocks are an extreme form of evil costing me I dont know how much of my life. Till modules came along, you had no name space control and could kill complex code by inadvertently using the same common block name as another part of program. No checks at all.
You want everyone using same globals? Stick them in a unit and include where required. What on earth is hard about that? At least as easy as commons and no chance of name space collision. Add a variable to common? Fine, now watch the fun if something used it that you forgot about and it didnt get checked in common. Many compilers dont even check for size equality between units because its perfectly legal not to. Only safe way is put commons into include files – oh and thats what C/Pascal/Java do anyway.
And I am doing thermal evolution of petroleum basins and geochemistry. These are not trivial physical models. Fortunately translated out of Fortran and into C++ some years ago. Same cant be said for the second law analysis of power station code which is stuck in fortran and the source of endless hassles to maintain.
Barton Paul Levenson // October 27, 2009 at 4:34 pm |
Phil Scadden:
I wouldn’t.
Nope. I was comparing assembler to Fortran, not C to Fortran. Read for context.
Excuse me, it slows me down, especially when I have to remember WHICH libraries (multiple) I need. I want to concentrate on the PROBLEM, not the LANGUAGE. Block-structured languages make the programmer think about the language instead of the problem.
Modules have been available in Fortran since the 1990 standard, which was, let me see, 19 years ago. In my RCMs I use ONE module. Period. All the globals in there. Haven’t had any problems. And I haven’t had to write and separately compile a unit, or worry about namespaces, or make files, or any of the rest of the language overhead you inevitably get with C-like languages.
Plus there’s the fact that you can READ Fortran and understand what’s going on right away, which is rarely the case with C. It’s a lot easier for anyone to figure out
do i = 1, 10
x(i) = x(i) + j
end do
at a glance than it is to figure out
for (i = 0; i < 9; i++)
{
x[i] += j;
}
at a glance. Or worse,
for (i = 0; i < 9; i++)
{
*ptr[i] += j;
}
Oh yeah, did I mention the computer-friendly but programmer-hostile convention of starting all arrays from 0 in C, Java, Javascript, and even a lot of the modern object-oriented versions of Basic, versus the natural and obvious Fortran convention of starting them at 1? Or the ease of writing / to start a new line in a Fortran format compared to '\n' in a C++ format? Or how easy it is to write F7.3 to write out a real number with three decimal places in Fortran, compared to %ld7.3 in C++? I could go on all day. The bottom line is that in Fortran I can FORGET about the arcane details of the language, because there just aren't that many, and concentrate on the problem.
I am NOT saying Fortran is better than C++ in all ways and for all purposes. But for numerical simulation, I would rather program in Fortran and be tired up in my basement listening to 48 hours of Rush Limbaugh than use C++.
David B. Benson // October 27, 2009 at 6:21 pm |
Barton Paul Levenson // October 27, 2009 at 4:34 pm — Looks like you would have trouble with elevators in Germany; ground floor is numeral 0. :-)
I don’t care that much for C myself, but I’ll point out theat “Numerical Recipes in C, 2nd edition” uses one-origin indexing. Imagine that, in a zero-origin programming language.
My biggest objection to all of the programming languages mentioned so far here is the imperative nature; that is always a source of hidden problems. I prefer mostly functional languages, currently using SML/NJ, even for numerical work. There are run-time faster versions of SML available and maybe F# from Microsoft is faster (although I still wouldn’t use it) than ocaml.
All of this does touch upon the basic point of this thread, the tension between best-fit-to-data and a measure of complexity. Now number of parameters iis a perfectly decent notion of complexity for polynomial models; somewhat worse for models with trig functions, exp and log. But what about a more complex model with some considerable decision making along the way? Certainly a GCM qualifies?
So far, what is called computational complexity does help very much if the models are in class P. Most physically based models are in class P? I don’t even know that.
David B. Benson // October 27, 2009 at 8:17 pm |
Oops! Computational complexity does not help…
Not left out.
dhogaza // October 28, 2009 at 12:39 am |
As someone who spent roughly 25 years of his life writing highly optimizing compilers for a variety of languages, I would claim that it depends on the program and compiler, and I would win that claim.
There’s nothing in Fortran that can intrinsically be compiled to more efficient code than C.
dhogaza // October 28, 2009 at 12:49 am |
Oh, and for the record, I hate C. And hate C++ more (some of that hatred having come from working on C++ implementations).
Barton Paul Levenson // October 28, 2009 at 9:34 am |
dhogaza:
Undoubtedly true, but in practice I’ve never found a C compiler that’s faster (I’ve used the old Mix Power C, Borland Turbo C, Borland C/C++, and MingW C). In practice, if not in theory, C is fast, but not as fast as Fortran.
dhogaza // October 28, 2009 at 2:47 pm |
It will depend entirely on the program and how it’s written. It’s true that Fortran compiler writers spend a lot more time concentrating on optimizing numerical computation than is typical for a C compiler.
Fortran and C tend to be used for different types of problems, and compiler writers (and those paying their salaries) know this.
C compiler writers also know that skilled C programmers will be writing low-level code, and have traditionally ignored much of the high-level optimizations (such as vectorization of array operations within loops) that are necessary to generate decent code from languages that *aren’t* glorified high-level assemblers.
Kevin McKinney // October 28, 2009 at 3:58 pm |
You guys are making me feel better about my mathematical/computational naivete. . .
Kevin McKinney // October 28, 2009 at 4:00 pm |
. . . meaning I’m glad not to have to worry about these arcana myself, even though I’m glad the expertise exists and is usefully deployed.
Donald Oats // October 29, 2009 at 7:32 am |
For statistics with a smattering of programming, I can recommend the entirely free “R” statistics environment, and “Tinn-R” as one of many editors available for writing R code and running it. R comes in Windows and Unix flavours.
R is in use by such a large statistics community that it isn’t going to disappear, and furthermore, there is a vast set of packages for anything from generalized linear models to bioinformatics affymetrix genomic data analysis, ODE solvers, and a great integrated graphics toolset. The R programming language is simple and interpretative, using LAPACK as the engine for matrix and vector calculations, so speed is rarely an issue if you can write a matrix equation using high-level matrix and vector operations.
R is available from CRAN (google “R” and the first few references should get you to it: etc) and various mirrors.
PS: R can interface to C, C++ and Fortran if necessary.
Andrew Dodds // October 29, 2009 at 2:38 pm |
D Benson -
I’ve seen that 1-origin stuff in Numerical Recipies in C and it is pretty hideous. In any case, we should stick to the one true programming language:
KenM // October 29, 2009 at 5:05 pm |
OOK! is nice, but I prefer whitespace for scientific programming.
David B. Benson // October 29, 2009 at 10:12 pm |
Andrew Dodds // October 29, 2009 at 2:38 pm &
KenM // October 29, 2009 at 5:05 pm —
:D | http://web.archive.org/web/20100104112901/http:/tamino.wordpress.com/2009/10/05/aic-part-1-kullback-leibler-divergence/ | CC-MAIN-2019-26 | refinedweb | 13,630 | 50.26 |
Java DateTime, Calendar Exercises: Check a year is a leap year or not
Java DateTime, Calendar: Exercise-18 with Solution
Write a Java program to check a year is a leap year or not.
Sample Solution:
Java Code:
public class Exercise18 { public static void main(String[] args) { //year to leap year or not int year = 2016; System.out.println(); if((year % 400 == 0) || ((year % 4 == 0) && (year % 100 != 0))) System.out.println("Year " + year + " is a leap year"); else System.out.println("Year " + year + " is not a leap year"); System.out.println(); } }
Sample Output:
Year 2016 is a leap year
Pictorial Presentation:
Flowchart:
Sample Solution:
Alternate Code :
import java.time.*; import java.util.*; public class Exercise18 { public static void main(String[] args) { LocalDate today = LocalDate.now(); if(today.isLeapYear()) { System.out.println("This year is Leap year"); } else { System.out.println("This year is not a Leap year"); } } }
Flowchart:
Java Code Editor:
Improve this sample solution and post your code through Disqus
Previous: Write a Java program to get a date before and after 1 year compares to the current date.
Next: Write a Java program to get year and months between two dates. | https://www.w3resource.com/java-exercises/datetime/java-datetime-exercise-18.php | CC-MAIN-2019-47 | refinedweb | 194 | 54.32 |
In this article we will discuss a few important options from among the hundreds provided by the gcc compiler to serve the needs of different types of programmers – student as well as professional.
First of all, we need to distinguish between GCC and gcc. GCC (GNU Compiler Collection) is a compiler system that provides compilers for the following programming languages – C, C++, Objective-C, FORTRAN, Ada, Go and D. The C compiler provided by GCC is called gcc. As the title suggests, this article is about gcc – the C compiler, and not about GCC, the compiler system. There’s also one question that needs to be answered before we proceed any further, and that is, “Do I really believe that the use of a compiler can ever be considered fun?” The answer is, yes. Exploring the features of gcc is not only informative but it could also be fun.
Let us begin by discussing two of the most commonly used options of gcc. Consider the simple C program pgm1.c given below. This and all the other programs along with their associated files discussed in this article can be downloaded from opensourceforu.com/article_source_code/Nov19funwithgcc.zip.
#include<stdio.h> #define NUMBER 5 int main() { int a = NUMBER; printf(“Square of %d is %d\n\n”, a, a*a); return 0; }
The gcc command gcc pgm1.c will compile the program pgm1.c to produce the Linux-executable file with the default name a.out. The executable file a.out can be executed with the command ./a.out. The executable file produced by gcc can be given a specific name by using the option -o. The command gcc pgm1.c -o exfile will create an executable file called exfile. This executable file can be executed with the command ./exfile. Figure 1 shows the execution of the program pgm1.c.
The compilation process of a program
The compilation of a C program involves a number of steps like preprocessing, generating assembly code, object code, executable code, etc. If required, gcc allows us to do this process step by step till we get an executable file. This is especially useful to computer science teachers because such an explanation will give students a clear understanding of the compilation process.
First, from the C file pgm1.c, let us create the preprocessed code in the file pgm1.i with the command gcc -E pgm1.c -o pgm1.i. Next, we will use the preprocessed code in pgm1.i to obtain the assembly code in the file pgm1.s with the command gcc -S pgm1.s. Next, the assembly code in the file pgm1.s is used to obtain the object code (relocatable machine code) in file pgm1.o with the command gcc -c pgm1.s. Finally, the object code in file pgm1.o is used to produce the executable (absolute machine code) file exfile with the command gcc pgm1.o -o exfile.
Figure 2 shows this step by step compilation process of the C program pgm1.c. In the figure, we can see that the macro NUMBER defined by the line of code #define NUMBER 5 and used in the line of code int a = NUMBER; in pgm1.c is replaced with the line of code int a =5;. Since the preprocessed file pgm1.i is very large, only the last six lines are printed with the command tail -6 pgm1.i.
Similarly, for the assembly code file also, only the last six lines are printed with the command tail-6 pgm1.s. The command ls shows all the files produced during the step by step compilation process.
Finally, the figure shows the output by executing the absolute machine code in file exfile.
Options for C versions and warnings
The C programming language has the following versions — K&R C, ANSI C (ISO C), c99, c11, and c18. Programmers can specify the version of C so that the gcc compiler can check whether the code is compliant with that particular standard or not. For example, the options -ansi, -std=c99, and -std=c11 can be used to specify ANSI C, c99, and c11 versions of C, respectively. For a better understanding of this, consider the small C program pgm2.c.
#include<stdio.h> int main() { int unix; return 0; }
Let us compile the C program pgm2.c with the commands gcc pgm2.c and gcc -ansi pgm2.c. Figure 3 shows the terminal after the commands have been executed. We get an error with the first command whereas the second command produces the executable file a.out. So why do we get an error with the first command? GCC provides predefined macros like UNIX as an extension, which are not part of standard C. So, the identifier unix is valid in ANSI C whereas in GCC it is not.
Now let us familiarise ourselves with a few options like Wall, Werror, etc, which are used for customising warnings during compilation. Previously, when we have compiled the C program pgm2.c, we didn’t get any warnings (see Figure 3). Now, let us compile pgm2.c with the option -Wall as gcc -ansi -Wall pgm2.c.
Figure 4 shows us that on compilation, we get the warning message Unused variable on the line of code int unix;. However, the option -Wall produces the executable file a.out whereas if the option –Werror is also added, no executable file is produced. This example also tells us that multiple gcc options can be used for a single compilation. The options -Wall and -Werror help us write code that does not contain any potential bugs in the later stages of development. I believe these options, when enabled, will allow students of C programming to write good quality code.
A C program without main() function
The gcc compiler allows us even to compile a C program without the main() function. This is one of the several solutions to the popular C programming puzzle, “Write a C program without the main() function.” This technique can also save at least three characters in C code golfing competitions, which are programming competitions in which the competitors try to write a program with the shortest source code possible to solve the given task. Consider the C program pgm3.c without the main() function, given below.
#include<stdio.h> #include<stdlib.h> int X( ) { printf(“\nHello World\n”); exit(0); }
We must be careful to use the exit(0) function instead of return 0; statement to terminate the program because the main() function is absent in the code. Figure 5 shows the output of the program pgm3.c when compiled with the command gcc -nostartfiles pgm3.c. In the figure, we can see that the gcc compiler issues a warning stating that the main() function is absent.
Options for optimisation
There are a number of options provided by gcc for optimisation of the code. Some of the options include –O0, -O1, O2, -O3, -Ofast, -Os, etc. Consider the program pgm4.c to better understand optimisation with gcc. The program pgm4.c measures and prints the execution time taken to initialise an integer array a[1000][1000] with the value 1. The program is suitable for optimisation because of a feature of the memory called spatial locality. Spatial locality refers to the use of data elements within relatively close storage locations. The C programming language uses row major ordering where two-dimensional arrays are stored, row by row, in memory. However, in the program pgm4.c, the two nested for loops and the line of code a[j][i]=1; store the number 1 in the array column by column. Therefore the time taken to access array elements is more than the time taken to access the same number of array elements row by row.
We will use different optimisation options to achieve faster and faster execution. Incidentally, even without any compiler optimisation, we can reduce the execution time by replacing the line of code a[j][i]=1; with the line a[i][j]=1;, where the initialisation will be done row by row.
#include<stdio.h> #include<time.h> int main( ) { float t1,t2,t3; int i,j,a[1000][1000]; t1=clock( ); for(i=0;i<1000;i++) { for(j=0;j<1000;j++) { a[j][i]=1; } } t2=clock( ); t3=(float)(((t2-t1)/CLOCKS_PER_SEC)*1000); printf(“\nTime taken = %f milliseconds\n”,t3); return 0; }
The GCC manual tells us that the options -O1, -O2, and -O3 optimise the code in such a way that the execution becomes faster and faster. Figure 6 shows the output of the program with and without optimisation. We can see that the execution becomes faster and faster, as expected, with the unoptimised code being the slowest and the code optimised with option -O3 being the fastest.
Options for conditional execution
There are many options provided by gcc for efficient debugging of code. One technique is to execute a certain piece of code only if a particular macro is defined. This code can be used only for testing or debugging and will not be executed during actual runs. The option -D defines a macro for a preprocessor to detect. The program pgm5.c illustrates the use of option -D for the conditional execution of code.
#include<stdio.h> int main() { printf(“I am always printed\n”); #ifdef DB printf(“Why I am printed now?\n”); #endif return 0; }
The command gcc pgm5.c compiles the program without the macro DB defined. The command gcc -D DB pgm5.c compiles the program with the macro DB defined. Figure 7 shows the output of the program pgm5.c with and without defining the macro DB. It can be seen from the figure that the conditionally executed line of code printf (“Why I am printed now?\n”); gets executed only when the macro DB is defined.
Please note that what we have seen in this article is just the tip of the iceberg. There are still hundreds of options in gcc remaining to be explored. Programmers can achieve different goals like platform-independent software development, efficient software development cycles, better debugging techniques, better training methods, etc, with these options. So, I am sure it will be immensely rewarding if you dig deeper into what gcc offers. | https://www.opensourceforu.com/2019/12/having-fun-with-gcc-the-c-compiler/ | CC-MAIN-2021-39 | refinedweb | 1,715 | 65.83 |
by Bhakti Mehta
JSR 109: Implementing Enterprise Web Services defines the programming model and runtime architecture for implementing web services in Java. The architecture builds on the Java EE component architecture to provide a client and server programming model that is portable and interoperable across application servers.. Two previous Tech Tips covered the two techniques.. The following tip is a successor to those previous tips. It describes how to develop an application client that references multiple web services that implement any combination of the two web services programming models.
A sample package accompanies this tip. It demonstrates a standalone Java client that accesses two web services, one implemented as a servlet and the other implemented an a stateless session bean. The example uses an open source application server called GlassFish v2, specifically GlassFish V2 UR1. You can download GlassFish v2 from the GlassFish Community Downloads page. You can find instructions on how to install and configure GlassFish here. Also see the GlassFish Quick Start Guide for the basic steps to start the server and deploy an application.
Let's start by creating the two web services.
The Servlet-Based Web Service
Here is the source code for
WeatherService, a servlet-based web service that displays the current
temperature for a given zip code. You can find the source code for
Weather Service in the
servlet_endpoint directory of the sample package.
@WebService public class WeatherService { public float echoTemperature(String zipcode) { System.out.println("Processing the temperature for " + zipcode); //Its Beverly Hills let it be nice and sunny !! return 80; } }
As you can see, JAX-WS 2.0 relies heavily on the use of annotations as specified in
JSR 175: A Metadata Facility for the Java
Programming Language and
JSR 181: Web Services Metadata for the Java
Platform, as well as additional annotations defined by the JAX-WS 2.0 specification.
Notice the
@WebService annotation in the
WeatherService class. This is an annotation
type defined in the
javax.jws.WebService package and marks the class as a web service.
A web service requires an endpoint implementation class, a service endpoint interface, and portable artifacts
for execution. However, as specified by JSR 109, you only need to provide
a
javax.jws.WebService-annotated service class, as is the case here.
Creating the EJB-Based Web Service
Here is the code for
DegreeConverter, a web service that is implemented as a stateless session bean.
This web service converts a temperature value from the Fahrenheit scale to the Celsius scale. You can find the source
code for
DegreeConverter in the
ejb_endpoint directory of the sample package.
@WebService @Stateless public class DegreeConverter { public float fahrenheitToCelsius(float far){ float degCelcius; degCelcius = (far - 32) * 9/12; return degCelcius; } }
One of the significant improvements in the Java EE 5 platform is a much simpler EJB programming model as defined in the
EJB 3.0 specification.You can declare a
class a session bean or entity bean simply by annotating it. For example, you can declare a class a stateless session bean
by annotating it with the
@Stateless annotation, as is the case for this web service .
Again, all you need to provide is the
javax.jws.WebService-annotated service class.
Compiling and Deploying the Web Services
After you create each web service, you need to compile it, generate portable artifacts for its execution, and deploy it. An ant task is provided in the sample package to perform these steps. See the section Running the Sample Code for details.
Creating the Client
After you deploy the web services, you can access them from a client program. The client uses
@WebServiceRef annotations to declare references to a web service. The
@WebServiceRef
annotation is in the
javax.xml.ws package, and is specified in JSR 181. If you examine the source code
for
Client, the client program used in this tip (you can find the source code for
Client
in the client directory of the installed sample package), you'll notice the following:
@WebServiceRefs({ @WebServiceRef(name="service/MyServletService", type=servlet_endpoint.WeatherServiceService.class, wsdlLocation=""), @WebServiceRef(name="service/MyEjbService", type=ejb_endpoint.DegreeConverterService.class, wsdlLocation="") }) public class Client { ...
The
@WebServiceRefs annotation allows multiple web service references to be declared in the class.
Here the class references two web service endpoints, a servlet endpoint and an EJB endpoint. Notice that each
@WebServiceRef annotation has the following properties:
Here is the code in
Client that looks up the servlet-based weather service, gets its port,
and invokes its
echoTemperature method:
javax.naming.InitialContext ic = new javax.naming.InitialContext(); WeatherServiceService svc = (WeatherServiceService)ic.lookup( "java:comp/env/service/MyServletService"); float temp = svc.getWeatherServicePort().echoTemperature("90210");
Here is the code in
Client that looks up the EJB-based service, gets its port, and invokes its
fahrenheitToCelsius method:
DegreeConverterService degConverter = (DegreeConverterService)ic.lookup( "java:comp/env/service/MyEjbService"); System.out.println("Invoking the degree converter service for zip 90210.. " ); float degree = degConverter.getDegreeConverterPort().fahrenheitToCelsius(temp); System.out.println("Temperature in degrees is " + degree);
Compiling and Running the Client
After you create the client, you need to generate portable artifacts required to compile the client and then compile the client. You can then run the client. An ant task is provided in the sample package to perform these steps. See the section Running the Sample Code for details.
Running the Sample Code
A sample package accompanies this tip. To install and run the sample:
<sample_install_dir>/webservicesrefs-techtip, where
<sample_install_dir>is the directory where you installed the sample package. For example, if you extracted the contents to
C:\on a Windows machine, then your newly created directory should be at
C:\webservicesrefs-techtip.
webservicesrefs-techtipdirectory and set
AS_HOMEin the
build.xmlfile to point to the location where you installed GlassFish. For example, if GlassFish is installed in a directory name
mydir/glassfish, set
AS_HOMEas follows:
<property name="AS_HOME" value="/mydir/glassfish"/>
<GF_install_dir>/bin/asadmin start-domain domain1
where <GF_install_dir> is the directory in which you installed GlassFish.
ant server
This ant task target builds the server-side classes for the web services, that is, it compiles the classes, generates the portable artifacts, and packages the war and EJB jar files. It then deploys the web services to GlassFish. The WSDL files for the web services are published to:
ant client
This ant task target runs the
wsimport utility to generate the client-side artifacts and then compiles
and runs the client. You should see the following in the response:
runclient: runclient-windows: runclient-non-windows: [exec] Invoking the weather service for zip 90210.. [exec] Temperature for zip 90210 is 80.0 [exec] Invoking the degree converter service for zip 90210.. [exec] Temperature in degrees is 36.0 BUILD SUCCESSFUL
Note: To run the sample with JDK 6 prior to the JDK 6 Update 4 release, you need use the endorsed override mechanism
by copying the
webservices-api.jar file from
<GF_install_dir>/lib/endorsed, where
<GF_install_dir> is the directory where you installed GlassFish, to
<jdk_install_dir>/jre/lib/endorsed, where
<jdk_install_dir> is the directory in which the runtime software is installed. If you run the sample
with JDK 6 Update 4 or later, you do not need to use the override mechanism.
About the Author
Bhakti Mehta is a Member of Technical Staff at Sun Microsystems. She is currently working on the implementation of JSR 109, the Web Services for Java EE specification. Previously she has worked on WS-Reliable Messaging to interoperate with the Microsoft Windows Communication Foundation, as well as the JAXB and JAXP Reference Implementations. She has a Masters Degree in Computer Science from the State University of New York at Binghamton and a Bachelors Degree in Computer Engineering from Mumbai University.
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Connect and Participate With GlassFish
Try GlassFish for a chance to win an iPhone. This sweepstakes ends on March 23, 2008. Submit your entry today.
Very nice article; thanks a lot.
Posted by Krunal Shimpi on April 04, 2008 at 02:37 AM PDT #
Good one.
Posted by Thiru on April 05, 2008 at 10:35 PM PDT #
this is greate but we fail to get more infomation especially for we begginers
Posted by ngalawa evans k on April 06, 2008 at 04:13 AM PDT #
What sort of information are you looking for? The tip does point to a number of other tips for background information.... "
Posted by Edort on April 06, 2008 at 10:39 AM PDT #
A minor point, 80 degrees F <> 36 degrees C. (actually equals 26.66667 degrees C). Believe the line
"degCelcius = (far - 32) * 9/12;" should read
"degCelcius = (far - 32) * 5/9;" in the DegreeConverter class.
Posted by Philip Randall on April 06, 2008 at 10:11 PM PDT #
Good stuff. Cheers =)
Posted by Aj Aslam on April 07, 2008 at 07:53 AM PDT #
Philip,
You are right , this was a mistake in the formula
Thanks for taking the time to read the tech tip
Regards,
Bhakti
Posted by Bhakti Mehta on April 07, 2008 at 10:46 AM PDT #
Thank you Bharti. Very illustrated and useful example.
Posted by Chander Bansal on April 08, 2008 at 05:09 AM PDT # :-)
Posted by Jan Schenkel on April 09, 2008 at 11:54 AM PDT #
You might want to look at the NetBeans End-2-End Demo. See. I believe it has everything you want and more.
Posted by edort on April 10, 2008 at 09:12 AM PDT #.
Posted by Jan Schenkel on April 14, 2008 at 12:29 AM PDT #
NICE ARTICLE FOR INTEROPERABILITY ...CAN WE MORE RESOURCES ADDDED FOR THE SAME AS LINKS
Posted by alok kumar on May 09, 2008 at 04:24 AM PDT #
Alok: Do you mean more links regarding an end-to-end example, or more links regarding how to reference multiple web services from an application client?
Posted by EdOrt on May 09, 2008 at 08:00 AM PDT # | http://blogs.sun.com/enterprisetechtips/entry/referencing_multiple_web_services_from | crawl-002 | refinedweb | 1,635 | 55.44 |
How to scrape Twitter data without an API
Welcome back! If you follow my articles you know I love scraping data, but you don’t care about my background, so let’s talk about scraping some Twitter data! In this tutorial we will be using Python, we’ll also be using Twitter’s website to get the data, this means no API, limits or credentials needed to get in the way of us getting valuable data!.
Within Selenium we need to define our web browser, so let’s do so by using the following line of code:
#THIS INITIALIZES THE DRIVER (AKA THE WEB BROWSER)
driver = webdriver.Chrome(ChromeDriverManager().install())
I would recommend running all of the code you just typed out and see if a blank Google Chrome window opens up, if so, you’re doing great 👍 !
At this point we want to create an empty Pandas data frame, this will allow us to store our data from Twitter into an actual iterating data frame that we can call later. For this article, I wanted to scrape some of the most common data points of a Twitter post, these data points could be the text of the Tweet, likes and retweets for that post, this is exactly how to setup this data frame within Python:
data1 = {'Tweet': [], 'Likes': [], 'Retweets': []}
fulldf = pd.DataFrame(data1)
Awesome! Now when you think of Twitter you must think about the different ways a tweet can be discovered, whether it’s a user retweeting it, someone sending it to you, etc. In this specific case we’ll be using a hashtag page to get some tweets from. This program will essentially go to a specific hashtag page and scrape the first tweet that it finds and store that data into our data frame. Now, this is a pretty simple task, but these are the building blocks for your future ☺️
At this point, we want our opened Chrome browser to go to a specific hashtag web page, to do this we must call the Selenium “driver.get” function, then place our link within the quotes, this may seem pretty intense, but this is the line we use:
driver.get("INSERT LINK HERE")
All we have to do now is find our specific webpage we want to bring in, let’s say we wanted the page for the hashtag “programming”, we want to go to that page and copy the link, then we just need to insert the link in the line above, our code will look like this:
driver.get("")
time.sleep(10)
The “time.sleep(10)” line just tells the program to wait 10 seconds before going to the next line, this is important if you’re loading a web page that has a lot of elements (like Twitter), you want to make sure to have some sort of command like that.
We are almost done, now all we have to do is select the specific elements we want from that page and copy the full xpath for those, to do this, we first want to store our variables as a Selenium “driver.find” function, this will allow us to scrape in that data straight into a variable which we can pull into our data frame we made before, this is the following code to do so:
Tweet = driver.find_element_by_xpath('INSERT LINE HERE').text
Likes = driver.find_element_by_xpath('INSERT LINE HERE').text
Retweets = driver.find_element_by_xpath('INSERT LINE HERE').text
We will be inserting new lines of code in there in a few seconds, but try to understand the process in these lines.
Next up, we want to have the web page loaded in our Selenium Google Chrome environment, we then want to right click over the text we want to store, in this case we want to store the actual Tweet, we then click inspect or inspect element, a little window like this will load up:
Great! At this point, we want to select over the specific highlighted text, you may see the actual text and match it with the number or text in the web page, all you have to do now is right click over that highlighted portion of code > Click copy > then copy full x path, just like the image below:
We then copy and paste this into that line of code that we did before into the Tweet variable, this completed line will look like this:
Tweet = driver.find_element_by_xpath(
'/html/body/div/div/div/div[2]/main/div/div/div/div/div/div[2]/div/div/section/div/div/div[1]/div/div/article/div/div/div/div[2]/div[2]/div[2]/div[1]/div/span[1]').text
Awesome! We now want to do this with the likes as well, highlight over the like number > right click on it > click inspect > Go to the highlighted portion of the code and right click on it > Copy > and copy full xpath, use the following image for reference:
We then copy and paste this into that line of code that we did before into the Likes variable, this completed line will look like this:
Awesome! We now want to do this with retweets as well, highlight over the like number > right click on it > click inspect > Go to the highlighted portion of the code and right click on it > Copy > and copy full xpath, use the following image as a reference:
We then copy and paste this into that line of code that we did before into the Likes variable, this completed line will look like this:
Finally, we want to store our tweets into a variable that we can append to our “fulldf” data frame we made before, to do this use the following line(s):
row = [Tweet, Likes, Retweets]
fulldf.loc[len(fulldf)] = row
Awesome! Now this is our completed code block, I did make some additions to it but for the most part it’s the same thing:
import time
import selenium
from selenium import webdriver
from webdriver_manager.chrome import ChromeDriverManager
import pandas as pd
# SETTING UP THE DRIVER TO USE CHROME
driver = webdriver.Chrome(ChromeDriverManager().install())
data1 = {'Tweet': [], 'Likes': [], 'Retweets': []}
fulldf = pd.DataFrame(data1)
driver.get("")
time.sleep(10)
Tweet = driver.find_element_by_xpath(
'/html/body/div/div/div/div[2]/main/div/div/div/div/div/div[2]/div/div/section/div/div/div[1]/div/div/article/div/div/div/div[2]/div[2]/div[2]/div[1]/div/span[1]').text
print(Tweet)
print(Likes)
print(Retweets)
row = [Tweet, Likes, Retweets]
fulldf.loc[len(fulldf)] = row
Great! now let’s run the program! When you run this program you will see the Google Chrome browser open up > Navigate straight to that web page > And within a few seconds the selected data points will be printed out in the Python console and stored into our data frame!
Thats pretty much it! Now, as I mentioned before this is a pretty basic project, but think about ways you can expand on this: Could you pull maybe more than one tweet at a time (Hint: use a loop and iterate through the numbers of the xpath)? Can you make a front end someone could paste a hashtag in and search through the tweets that way (Hint: use Streamlit or other GUI building Python tool and use the URL to iterate through the hashtags)? These are some massive things you can do to add to this project and improve your skill set! | https://preettheman.medium.com/how-to-scrape-twitter-data-without-an-api-1c1325f64ea1?source=post_internal_links---------1---------------------------- | CC-MAIN-2021-21 | refinedweb | 1,239 | 60.38 |
tag:blogger.com,1999:blog-26740471889690687932018-05-29T17:36:00.425+10:00Unify and ConquerMessaging, Collaboration and Unified Communications for the MassesCraig Pringle Australia Should be a Full Week<p>Last week I attended TechEd Australia in the Gold Coast. I had a great time learning, connecting, talking, networking, teaching, socialising and presenting. Having said that I left the Gold Coast both drained and a bit frustrated. </p> <p>While there was a lot of content there, there was an awful lot of content that was <strong>not</strong>.</p> <p. </p> <p. </p> .</p> . </p> <p>I tweeted this thought the other day and got a few comments back from people who thought two more days would be great if their livers could hold out. What say you Microsoft?</p> Craig Pringle Lunch at TechEd Australia<p>Sydney UC and Melbourne UC are getting together for Lunch at TechEd Australia. This grand event is sponsored by Tandberg.</p><p>Come along for lunch, a chance to mingle with your like minded peers and a chance to win a Tandberg HD webcam. Click the Register button below to register via eventbrite.com.</p><br /><div style="width: 250px"><iframe name="calendar" id="mgframe" src="" width="250" height="500" marginheight="0" marginwidth="0" scrolling="no" frameborder="0" ></iframe><a href=""><img src="" alt="Events" border="0"/></a></div>Craig Pringle Sydney UC Meeting<p>Well it has been a long time between we’re going to make up for it now! Today Johann posted details of our <a href="">August meeting on the SydneyUC site</a>. It is going to be a call session with <a href="">Alloy</a> coming along to tell us all about the SNOM OCS range of phones that they distribute in Australia. </p> <blockquote> <p>The <strong>snom OCS Edition </strong>(snom Open Communication Solution Edition) combines the advantages of the open IP telephony standard SIP with the integration into Microsoft’s Office Communication Server 2007 and the complete Unified Communications solution. </p> <p>snom phones are the <strong>first open-standard</strong> SIP phones with native Microsoft® Office Communication Server 2007 integration.</p> </blockquote> <p>We are also hoping to have a TechEd Speaker Rapidfire session where we get all the UC track presenters we can find to present (or record) a 5-10 minute overview of what they will be presenting up at the Gold Coast. I’ve not heard how we are going at getting said speakers, but Derrick and I will be there, as will John Smith so we should at least have the important ones ;)</p> <p>We are also scheming a bit of a UC focused meetup at TechEd – so those of you attending this year stay tuned.</p> Craig Pringle ANZ Call for Papers Out Now<p>Think you’ve got a good idea for a TechEd session for TechEd Australia and/or TechEd NZ? Well don’t just sit there – submit your idea and you may get the chance to present at TechEd this year.</p> <p><a href="">Johann Kruse</a> is the UC track owner and he tells us how with <a href="">this post</a>:</p> <blockquote> <p>So how do you go about submitting a session? Go to the <a href="">Call for Content tool</a> and register with your email address and the RSVP code <strong>TechEdANZ</strong>. Fill in all the details and hit submit. You can come back to the site at any time to update or review the progress of your submission.</p> </blockquote> <p>TechEd is always a great event – and often the sessions submitted by the community are among the best. Speaking or attending I look forward to seeing you there.</p> Craig Pringle Whitepapers available on discussUC.com<p>A friend of mine from NET Australia flicked me the following on Monday – I’ve just not had a chance to put it up.</p> <blockquote> <p>Today NET Australia has made its most popular whitepapers available at discussUC.com. The white papers cover a range of topics such as:</p> <ul> <li>SIP Trunking</li> <li>Directory Based Call Routing</li> <li>Enabling Resilient, Secure, and High Availability Voice Services in Microsoft OCS Deployments</li> <li>Key Success Factors for Microsoft UC Implementations</li> </ul> <p>NET Australia has made these papers available through discussUC.com as it is the largest subscribed Unified Communications websites in the region, with contributions from thousands of members worldwide.</p> <p><a href=""><img style="border-bottom: 0px; border-left: 0px; display: inline; border-top: 0px; border-right: 0px" title="clip_image002" border="0" alt="clip_image002" src="" width="64" height="64" /></a><a href=""></a></p> </blockquote> <p>Great initiative NET. Thanks for contributing to the community! (not to mention making such great products in the first place)</p> Craig Pringle 2010 Beta Released<p>Microsoft have released the public beta of Exchange 2010.</p> <p>There is a <a href="">good overview</a> that outlines the improvements you can expect in areas such as storage, availability, administration, access, compliance and more.</p> <p>There is a wealth of additional information on the <a href="">official Exchange 2010 site</a>. I strongly encourage you to explore that site. </p> <p>If you just want to jump straight in, however, you can <a href="">download the beta here</a>.</p> <p>Have Fun!</p> Craig Pringle Sensitive Certificates in OCS?<p>I had a heck of a time getting OCS R2 and Exchange Unified Messaging playing nicely together. I had set up both environments and I could dial extensions in the OCS environment, but I could not dial the subscriber access number for Exchange UM.</p> <p>In the event logs on the OCS Front End server I was seeing the following events.</p> <blockquote> <p>Source: OCS Exchange Unified Messaging Routing</p> <p>Event ID: 1040</p> <p>The attempt failed with response code 504: EXUM1.domain.com. <br />Failure occurrences:> <blockquote> <p>Source: OCS Protocol Stack </p> <p>Event ID: 1001</p> <p>TLS outgoing connection failures. <br />Over the past 28 minutes Office Communications Server has experienced TLS outgoing connection failures 3 time(s). The error code of the last failure is 0x80090322 (The target principal name is incorrect.) while trying to connect to the host "EXUM1.domain.com". <br />Cause: Wrong principal error could happen if the peer presents a certificate whose subject name does not match the peer name. Certificate root not trusted error could happen if the peer certificate was issued by remote CA that is not trusted by the local machine. <br />Resolution: <br />For untrusted root errors, ensure that the remote CA certificate chain is installed locally. If you have already installed the remote CA certificate chain, then try rebooting the computer.</p> </blockquote> <p>----</p> <blockquote> <p>Source: OCS Exchange Unified Messaging Routing</p> <p>Event ID: 1040</p> <p>An attempt to route to an Exchange UM server failed. <br />The attempt failed with response code 504: EXUM1.domain.com. <br />Failure occurrences:> <p>On the Exchange UM server I was just seeing the following event:</p> <blockquote> <p>Source: MSExchange Unified Messaging</p> <p>Event ID: 1088</p> <p>The IP gateway or IP-PBX "OCSSTD1.domain.com" did not respond to a SIP OPTIONS request from the Unified Messaging server. The error code that was returned is "0" and the error text is ":Unable to establish a connection.".</p> </blockquote> <p>----</p> <p>This all pointed a certificate problem. But the certificates were all issued by an internal CA and both servers trusted the Root CA Certificate. The names in the event log matched the subject names on the certificates, in that they both have the FQDNs of the servers.</p> <p>I tried reissuing the certificates but the problem persisted. </p> <p>Then I noticed something – in a couple of events on the OCS Server it referred to the Exchange Server like this:</p> <blockquote> <p>The error code of the last failure is 0x80090322 (The target principal name is incorrect.) while trying to connect to the host "EXUM1.domain.com".</p> </blockquote> <p>But in my case the certificates had the FQDN all in lowercase like this:</p> <blockquote> <p>exum1.domain.com</p> </blockquote> <p>Now – it shouldn’t matter but by this stage I was clutching at straws. So I changed my powershell command and requested a new cert with the servername in uppercase. After I assigned this certificate to the UM server I restarted the Exchange Unified Messaging service and checked the event logs and low and behold – none of the events were logged.</p> <p>I tried to make a call to Exchange UM and got a new error – which was progress and will be the subject of another post. At any rate the certificate issue was resolved.</p> Craig Pringle: Install a new language pack for Exchange UM<p>Installing a new language pack for Exchange Unified messaging is pretty easy. In addition to the default English US there are a number additional language packs on the installation media. </p> <p>The following files are in the \UM directory on the media.</p> <ul> <li>umlang-de-DE.msi</li> <li>umlang-en-AU.msi</li> <li>umlang-en-GB.msi</li> <li>umlang-es-ES.msi</li> <li>umlang-es-MX.msi</li> <li>umlang-fr-CA.msi</li> <li>umlang-fr-FR.msi</li> <li>umlang-it-IT.msi</li> <li>umlang-ja-JP.msi</li> <li>umlang-ko-KR.msi</li> <li>umlang-nl-NL.msi</li> <li>umlang-pt-BR.msi</li> <li>umlang-sv-SE.msi</li> <li>umlang-zh-CN.msi</li> <li>umlang-zh-TW.msi</li> </ul> <p>Each of these MSI files is a language pack. These are also available for <a href="">download from Microsoft</a>.</p> <p>Once you have your language pack you need to install it onto each Exchange UM server you want the language pack available on.</p> <p>This is done by running the setup command on the CD. The command format is:</p> <p>Setup.com /AddUmLanguagePack:<em>xx-YY</em> /s:<em><path to language pack></em></p> <p>where xx-YY is the language you want to install, which is in the name of the MSI file. For example I used the command below to install the Australian English on my Exchange UM server.</p> <p><a href=""><img style="border-bottom: 0px; border-left: 0px; display: inline; border-top: 0px; border-right: 0px" title="clip_image002" border="0" alt="clip_image002" src="" width="424" height="190" /></a></p> Craig Pringle Meeting – the Good and Bad<p>The March <a href="">Sydney UC</a> meeting was a blast. An absolute roaring success! As long as you were actually there. You see we were all hooked up to the Live Meeting well before the scheduled start time. And then 5 minutes before the start – the Live Meeting session dropped and we could not get back in. The irony of it all.</p> <p>Apologies to the people who were unable to attend via Live Meeting. This is, unfortunately, one of the key challenges with cloud based services. You are utterly dependant on the cloud actually being available. </p> <p>That aside we had a good session. I gave an overview of the portable OCS R2 lab I have been building. It has been an interesting experience and I encountered and conquered a few issues along the way. </p> <p>Then Jeff Wang from Tandberg gave a great overview of the OCS R2 and Tandberg integration and interoperability story. It was a great story and Jeff presented it brilliantly. Scenarios demonstrated included:</p> <ul> <li>OCS MOC client to room based system video call</li> <li>Video phone to MOC client call</li> <li>Video call forking to MOC and Video phone</li> <li>Multiparty ad-hoc video including Tandberg and OCS endpoints</li> <li>Scheduled multiparty video calls.</li> </ul> <p>After that Wayne Lee from GN (Jabra) gave a session about Jabra’s background and product range. Wayne highlighted the benefits of using OCS certified devices and gave a good overview of the devices that Jabra offer today.</p> <p>Over all it was a great session and we had a good turn out. We are planning another session in April, so keep an eye on the <a href="">Sydney UC</a> site, the <a href="">RSS feed</a>, our <a href="">Facebook page</a> or the <a href="">#sydneyuc twitter tag</a>.</p> Craig Pringle the Transport Dumpster in E2k7 SP1<p>Chris Goosen has a great post about the Exchange Transport Dumpster and how to move it from its default location.</p> <p>I won’t repeat it all here – <a href="">check it out here</a>.</p> Craig Pringle Meeting of Sydney UC<p>Details of the March Sydney UC meeting are on the <a href="">Sydney UC blog.</a></p> <p>To save a click:</p> <blockquote> <p>At the March Sydney UC Community meeting TANDBERG will demonstrate how the ubiquitous Microsoft Office Communicator video capability can be easily integrated into an organisations visual communication platforms. Specifically, the group will see how user friendly the TANDBERG-OCS integration is and how it can reduce user training requirements and increase usage and adoption of video to improve workflow and communication. <br />In addition TANDERG will share our roadmap showing the exciting additional features that are upcoming with the imminent release of Microsoft OCS 2007 R2, and how TANDBERG will integrate into Microsoft OCS R2 further to be one step closer a vision of completely Unified Communications. <br />Jabra will also be presenting on some of their new UC hardware including the M5390 and Dial 520 OC.</p> </blockquote> <p>Sydney UC is also on Facebook, become a friend and register for events on <a href="">our profile page</a>.</p> <p>Remember that if you can’t physically make the event the session will be available via Live Meeting around the globe. There is a link for the live meeting <a href="">on the Facebook event</a>.</p> <p>Also – if you are using Twitter – keep an eye on the <a href="">#sydneyuc</a> tag for updates = we’ll be using that as well going forward.</p> Craig Pringle post or OCS R2 licensing<p>Mike Stay has a <a href="">great post about OCS R2 licensing</a>. It covers the ins and outs of R2 licensing including what has and hasn't changed from OCS 2007. Of course Mike also covers off the obligatory MS Licensing nuance. Great Post.</p> Craig Pringle First Actual Meeting of SydneyUC<p>After announcing the group at TechEd Australia we've been waiting for the right time to kick it off proper. What were we waiting for? Content of course!</p> <blockquote> <p>On the agenda will be Microsoft’s <a href="">announcement of OCS 2007 R2</a>, a discussion on the recent <a href="">Microsoft/Telstra S+S announcements</a>, as well as updates on the latest UC and mobility devices and hardware.</p> </blockquote> <p><strong>Where: </strong>Gen-i’s offices at Level 23, World Square, Sydney (World Square is 680 George St).</p> <p><strong>When:</strong> Tuesday, November the 18th. 1:30 Eastern Daylight Time</p> <p>Hope you can all make it - but if you can't don't fret! This is a UC user group! As Johann posted on the <a href="">Sydney UC</a> site...</p> <blockquote> <p>However for those of you who can’t make it or have prior commitments – we will also be making the meeting available through LiveMeeting and it will be recorded so you can watch later (details to come later).</p> </blockquote> <p>See you then - and make sure you subscribe to the <a href="">Sydney UC Feed</a></p> Craig Pringle last! Two Exchange profiles open at the same time<p>While it is possible to have two Outlook profiles on one machine and to configure these profiles to point to different Exchange environments it has always bugged me that you can only have one profile open at one time. Until now.</p> <p><a href="">Nick Randolph</a> pointed out a really great little tool that allows you to launch a second, independent instance of Outlook in which you can open a different Outlook profile.</p> <blockquote> <p"</p> </blockquote> <p>ExtraOutlook is available from <a href="">HammerOfGod</a>. Groovy.</p> Craig Pringle Communications will Transcend the Language Barrier<p>There is an interesting new bot available for Windows Live Messenger that provides translation between English and several other languages.</p> <p>Simply add "<strong>mtbot@hotmail.com</strong>" to you Windows Live Messenger contacts, then send a message to Tbot.</p> <p>Tbot will ask you what language you want to translate from and to and then respond with translations when you type.</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="244" alt="image" src="" width="215" border="0" /></a> Now, you can always invite another person to the conversation, who writes in the language you are translating to and then chat back and forth.</p> <p>This is very cool, even though it is still a bit clunky. However, I can see a time in the not too distant future where the translation service will be server side in the corporate instant messaging products. Imagine a US based employee chatting with an employee in Spain, with both parties typing in their own language. Or an English speaker collaborating with a business partner in China via instant messaging with real time translation. It does not seem that far fetched, does it?</p> <p>Now ask yourself - what about speech? Today we can turn speech into text with a fair degree of accuracy. We can also translate text from one language to another and we can synthesise text back into speech. How far away are we from two people having a real time <em>spoken</em> conversation in which each participant speaks their own language and hears a translated version of the other party? </p> <p>I believe it will happen one day.</p> Craig Pringle Tip: Testing DNS SRV Records with NSLookup<p> Office Communicator relies on Service Location (SRV) records in DNS for auto-configuration. Frequently you can't create the external DNS record yourself so you need to ask your ISP or DNS provider to do it for you.</p> <p>So if the service provider is swearing black and blue that the records have been created correctly but your external client is not finding the server checking your DNS configuration is a great place to start.</p> <p>There is a tool in the <a href="">OCS Resource Kit</a> called <b>SRVLookup</b> that will fetch and parse the SRV records for a given domain for your review.</p> <p....</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="136" alt="nslookup" src="" width="244" border="0" /></a></p> Craig Pringle UC Kicks off tomorrow<p>Johann has posted up on the <a href="">Sydney UC blog</a> the <a href="">details for the kick off meeting for the Sydney UC Group</a>.</p> <blockquote> <p>The first Sydney UC meeting will be held at the<strong> Harbourside Pie Cafe</strong> at <strong>2:15pm</strong> on <strong>Thursday the 4th of September</strong>.</p> <p>Come along and have a gourmet pie and a cold beverage, and meet your peers. This meeting is an informal meet & greet so we can catch-up and get to know each other over lunch.</p> </blockquote> <p>Check out the <a href="">full post</a> for more details. See you there.</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="122" alt="venuemap" src="" width="244" border="0" /></a></p> Craig Pringle Demo Environment Rocks<p>Derrick and I are putting the finishing touches on our demo environment for our session at TechEd Australia.</p> <p>It consists of two host PCs each with a Quad Core processor, a pair of 500GB drives configured in a RAID 0 array for speed and 8 GB of RAM. These have Windows 2008 Server installed and are running Hyper-V. Between them they host 9 virtual servers. In addition to that we will be using a number of laptops as client machines.</p> <p>If you come along you will see what OCS Edge Services can really do! Remote User Access, Federation, Web Conferencing and more. This will be a demo not to be missed. I can't wait!</p> Craig Pringle're launching a UC User Group at TechEd Next Week<p><a href="">Johann Kruse</a>, <a href="">Derrick Buckley</a>, <a href="">James McCutcheon</a>, <a href="">Dr. Neil</a> and I are kicking off a new <a href="">UC User Group</a> at <a href="">Tech Ed Australia</a> next week. </p> <blockquote> <p>Johann has put up an <a href="">initial post about the event on the group's blog</a>.</p> <p>If you work (or play) in Unified Communications, we are kicking off a new UC community next week at Tech.Ed in Sydney.</p> <p>Come along and meet your peers in the industry, and see what we’re planning for the user-group.</p> <p>This first session will be a meet & greet, and we will also present a roadmap of content in upcoming meetings. Future meetings will be held at Microsoft in North Ryde, as well as via LiveMeeting.</p> </blockquote> <p>So if you are going to be at TechEd then please come and join us at <strong>lunchtime on Thursday September 4th, from 1:15pm-2pm</strong>. The room is still TBA but we'll keep you posted.</p> Craig Pringle at TechEd Australia<p>I am going to be co-presenting a session on OCS Edge Services with my good friend and fellow MVP <a href="">Derrick Buckley</a>. The session is on Friday the 5th of September at 11:45. Here's the details.</p> <p><b>UNC316</b></p> <p><b>Office Communications Server 2007 Security: Architecture and Edge Services</b></p> <p><i>One of the core value propositions for Office Communications Server (OCS) 2007, is the fact that unified communications can be used anywhere - at work, at home, or on the road. In this session, we discuss the edge aspects of OCS 2007 for voice, media conferencing, remote access, public internet connectivity and federation, along with the edge server roles. We discuss various edge server deployment topologies. We also discuss NAT and firewall traversal with discussion on how OCS 2007 uses ICE, STUN and TURN for audio and video.</i></p> <p>If you are coming to TechEd in Sydney this year then make sure you get it in your session builder now!</p> Craig Pringle VBScript to Set the Country for an AD Contact<p>I was recently asked to produce a VBScript that would take data imported from a very useless CRM system as a CSV and create contacts in Active Directory.</p> <p>All was going swimmingly until I got to the last field of the contact - country. The source database allowed free text for this field and AD expects to get a 2 letter ISO country code.</p> <p>I found a web site with the country codes listed and copy and pasted it into Word.</p> <p>Next I selected all the text and pressed Shift+F3 to toggle it all into upper case. This gave me a long list in the format</p> <blockquote> <p>COUNTRYNAME XX</p> </blockquote> <p>Where XX is the corresponding country code. (For example, Australia is AU)</p> <p>I copied and pasted the resulting list into <a href="">Primal Script</a>. This is where Primal Script came into its own and saved me hours.</p> <p>I created two new Snippets in the Primal Script Snippet manager</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="95" alt="image" src="" width="193" border="0" /></a> The CountryCase snippet contains the following code:</p> <blockquote> <p>Case "$SELECTION" </p> </blockquote> <p>If I select a country name and double click the CountryCase snippet it replaces it with a correctly indented Case statement with the selected text inside the quotes. The snippet also included a new line character, so the associated country code would be on the next line.</p> <blockquote> <p>Case "AUSTRALIA"</p> <p>AU</p> </blockquote> <p>The CountryCode snippet contained the following code:</p> <blockquote> <p>communicator team blog</a> has a brief overview of the <a href="">integration available between Outlook and Office Communicator</a> and how this works.</p> <blockquote> <p>Communicator Presence can be found throughout Outlook (Presence is the colored bubble that appears next to a person’s name). <p.</p></blockquote> <p>An interesting read, I've not given much thought to how this works because it just does.</p> Craig Pringle fight spam - configure SenderID<p>Recently there has been a flood of NDR spam that has been hitting organisations that has been - frankly - a pain in the butt for them. The way this type of spam attack works is simple. The bad guy generates anywhere from a few hundred to a few thousand bogus emails advertising pills, watches or whatever they are selling. They send these to bogus users at real organisations, but they create the messages with a valid sender address. It is the sender address that is the real target of the spam attack. </p> <p>On receiving the email the receiving server looks up the recipient address and finds that it does not exist. No one here by that name... Most mail servers are configured to "bounce" the email by way of a special kind of email called a Non-Delivery Report (NDR). This is then sent back to spoofed sender with the spam message as an attachment. Because the NDR is coming from a real mail server and a valid address it will snake past most spam filtering software and real time blacklist checks, thereby delivering the content as an attachment to the target.</p> <p>There is a fairly simple way to mitigate the risk of this kind of attack. It is free to protect your own namespace and it only takes minutes. If you are running Exchange 2003 SP2 or later you can do even more to prevent your mail server being used as the bounce server. The answer is called SenderID and it is part of the Intelligent Message Filter installed with Exchange 2003 SP2.</p> <p>From the <a href="">Microsoft SenderID website</a>:</p> <blockquote> <p>The Sender ID framework, developed jointly by Microsoft and industry partners, addresses a key part of the spam problem: the difficulty of verifying a sender's identity.</p> </blockquote> <p>To put it simply an email server that supports the SenderID framework queries a special DNS record to validate that the computer submitting an email is allowed to send for that domain.</p> <p>The Microsoft site also includes <a href="">this overview</a>:</p> <blockquote> <p><img height="187" alt="" src="" width="455" border="0" /></p> <ol> <li>A sender or user sends an e-mail message from an e-mail client or Web interface. No interaction or changes to the sender's client or Mail Transfer Agent (MTA) are required.</li> <li>The recipient's inbound e-mail server receives the e-mail message. The server uses SIDF and calls the Purported Responsible Domain's (PRA) DNS for the SPF record.</li> <li>The receiving MTA determines whether the outbound e-mail server's IP address matches the IP addresses that are authorized to send e-mail for the domain.</li> <li>For most domains and IPs, sender reputation data is applied to the SIDF verdict check.</li> <li>Based on the SPF record syntax, the pass or fail verdict, the reputation data, and the content filtering score, the receiving MTA delivers the e-mail message to the inbox, a junk or bulk folder, or a quarantine folder. If an e-mail fails, the receiving network may block, delete, or junk the e-mail. </li> </ol> </blockquote> <p>So as you can possibly figure out at this point there are two things you can do in your organisation that would help.</p> <ol> <li>Create a Sender Policy Framework (SPF) DNS record that specifies your permitted mail servers. This will help protect your namespace as any server that supports SenderID will check this record.</li> <li>Enable SenderID checking on your inbound mail server.</li> </ol> <p>In order to create the SPF record, Microsoft provide an <a href="">online wizard</a> to help you generate the text that you need to put into a TXT record in DNS to make your own SPF.</p> <p>To find out more about configuring SenderID on Exchange 2003 SP2 or later - refer to the <a href="">Microsoft Exchange Server Intelligent Message Filter v2 Operations Guide</a>.</p> Craig Pringle 2007 Phone Edition update<p>There is a <a href=";EN-US;949659">new update for the Communicator 2007 Phone Edition</a> devices (aka Tanjay).</p> <p>This update addresses a number of issues. Here's a list of the fixes.</p> <blockquote> <p>A call to a mobile number does not go through correctly for an Outlook contact who has an invalid instant messaging (IM) address. <br /><em>If the IM address is not understood, callback uses the e-mail address to index the contact. </em></p> <p>A call to an Outlook contact from the voice mail screen does not go through correctly. <br /><em>Calls to the highlighted contact on the voice mail screen were made to the IM address. Calls now use the same method as the contact list. Calls to Outlook contacts from the voice mail screen are made to telephone numbers and not to IM addresses. </em></p> <p>User credentials are lost if the network connection is lost after the user signs in to Microsoft Office Communicator. <br /><em>The condition that causes this issue has been fixed. </em></p> <p>The voice mail count may be incorrect for users who have long contact lists. <br /><em>The sequence of retrieving the voice mail count from Exchange has been adjusted. </em></p> <p>Calls to Outlook contacts do not go through correctly if the contact does not have a work telephone number listed. <br /><em>The preference order for IM and e-mail has been changed to work telephone number, home number, and mobile number.</em> </p> <p>Office Communicator 2007 does not retrieve a mobile number for an Outlook contact that is also a global address list (GAL) contact. <br /><em>The contact indexing mechanism on the telephone now processes x400/500 e-mail addresses. </em></p> <p>Off-hook dialing fails when the location profile is unavailable. <br /><em>The condition that causes this issue has been fixed. </em></p> <p>Kerberos fails when an Active Directory server that has multiple network adapters installed has only one network adapter connected to the network <br /><em>Make sure that all provisioned Active Directory network adapters are connected to the network.</em> </p> <p>Communicator Phone Edition stops responding when you try to end an unestablished call. <br /><em>The condition that causes this issue has been fixed.</em> </p> <p>Communicator Phone Edition stops responding when it is in an on-hook state. <br /><em>The condition that causes the unintended watchdog activation has been fixed. </em></p> <p>The date of items that are in the call log view is one day earlier than the actual date of the call log item. <br /><em>The leap year condition that causes this issue has been fixed.</em> </p> </blockquote> <p>The update also includes all the fixes from the <a href="">previous update</a>.</p> <p><a href="">Download the package</a> from Microsoft.</p> Craig Pringle Keynote<p>It's day 2 now at <a href="">Interact08</a> and it's my first opportunity to post my thoughts on the keynote delivered yesterday by <a href="">Gurdeep Sing Pall</a> - Microsoft's Corporate Vice President, Unified Communications Group.</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="184" alt="PICT0005" src="" width="244" border="0" /></a> </p> <p>Gurdeep talked about the acceleration in technology adoption rates, pointing out that it took 100 years from the time that the telephone was invented to get 1 billion people using it, but it has taken just 10 years or less to get the same number of people using technologies like email, instant messaging and mobile phones.</p> <p>He then talked about Microsoft's view of what UC is and emphasised that identity and presence are at the core of Unified Communications. </p> <p>Gurdeep also used <a href="'s_hierarchy_of_needs">Maslow's Hierarchy of needs</a> - which is a model used to describe a theory of human motivation. </p> <p><a href=""><img style="border-top-width: 0px; border-left-width: 0px; border-bottom-width: 0px; border-right-width: 0px" height="215" alt="maslows_hierarchy2" src="" width="240" border="0" /></a> </p> <p>In brief Maslow's theory states that unless a persons most basic needs are being taken care of they are not going to be in a position to give any thought to creative or abstract concepts.</p> <p>He drew a parallel to IT Managers in that if an organisation's most basic needs are not in a good state they are not going to be in a position for proactive re-architecture. If the phones don't have dial tone they are not going to be in a position to communications enable business processes.</p> <p>There followed a great demo of the real value of UC. what was great about it was that it was not run from Office Communicator or from Outlook. It was a demo of a Point of Sale application that had been "Communications enabled" and it was run from a Tablet PC.</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="184" alt="PICT0009" src="" width="244" border="0" /></a></p> <p>The demo scenario was a customer asking a staff member if they had a particular product. From their tablet pc the employee can check stock in other nearby stores. He could then see who in the other store was online and available to take a call.</p> <p><a href=""><img style="border-right: 0px; border-top: 0px; border-left: 0px; border-bottom: 0px" height="184" alt="PICT0008" src="" width="244" border="0" /></a></p> The call was then initiated from within the PoS app using the tablet's speakers & microphone. On the receiving end the incoming call had a subject indicated that the call was a stock enquiry for a particular product and the app automatically displayed info that was contextually relevant - their stock level for that product. This means that at the time the call is answered the person already knows what it is about and has the information required to help at hand. A very compelling demo. Craig Pringle | http://feeds.feedburner.com/UnifyAndConquer | CC-MAIN-2018-30 | refinedweb | 5,969 | 60.35 |
Through this part of the Scala tutorial you will learn about classes and objects, semicolon inference, singleton objects, and more.
A class is a blueprint for objects. Once you define a class, you can create objects from the class with the keyword new. A class definition contains field declarations and method definitions from which fields are used to store the state of an object and methods provides the access to fields and alter the state of an object etc.
Want to get certified in Scala! Learn Scala from top Scala experts and excel in your career with Intellipaat’s Scala certification!
e.g.
class Point(i: Int, j: Int) {
var x: Int = i
var y: Int = j
def move(xd: Int, yd: Int) {
x = x + xd
y = y + yd
println ("Point in x location is: " + x);
println ("Point in y location is : " + y);
}
}
Enroll yourself in Online Scala Training and give a head-start to your career in Scala!
Once a class is defined then you should be able to construct an object for this class. The syntax is –
var object-name = new class_name()
e.g.
val pt1 = new Point(10, 0);
Semicolon inference
In scala the use of semicolon at the end of a statement is not compulsory. If you want to write a single statement in a single line then there is no need to use semicolon but the semicolon is required when you want to write many statements on a single line:
e.g.
val s = "hello"; println(s)
if (x < 2)
println("x is less than 2")
else
println("x is not less than 2")
Still, have queries? Come to Intellipaat’s Scala Community, clarify all your doubts, and excel in your career!
Singleton objects
There is one way in which scala is more object-oriented than Java is that the classes in Scala cannot have a static member. In its place, it has singleton objects. A singleton object definition is like a class definition but in this use the keyword object except for class keyword.
class Point(val i: Int, val j: Int) {
var x: Int = i
var y: Int = j
def moves(xd: Int, yd: Int) {
x = x + xd
y = y + yd
println ("New point in x location is: " + x);
println ("New point in y location is : " + y);
}
}
object Intellipaat {
def main(args: Array[String]) {
val pt1 = new Point(10, 0); // object pt1
pt1.moves(20, 10); // Move the point into another location
}
}
Looking for a job change in Scala? Check out this informative blog on Jobs in Scala and excel in your career!
Then Compile and execute the above program as follows: scalac Intellipaat.scala scala Intellipaat Output New point in x location is: 30 New point in y location is: 10
Interested in learning Scala? Check out the Scala Training in New York!
Leave a Reply Cancel reply
Your email address will not be published. Required fields are marked *
Comment
Name *
Browse Categories | https://intellipaat.com/blog/tutorial/scala-tutorial/scala-classes-and-objects/ | CC-MAIN-2020-40 | refinedweb | 491 | 68.6 |
Provided by: manpages-pt-dev_20040726-4_all
NAME
calloc, malloc, free, realloc - Allocate and free dynamic memory
SYNOPSIS
#include <stdlib.h>().
RETURN VALUES
For calloc() and malloc(), the value returned is a pointer to the allocated memory, which is suitably aligned for any kind of variable, or NULL if the request fails. free() returns no value. realloc() returns a pointer to the newly allocated memory, which is suitably aligned for any kind of variable and may be different from ptr, or NULL if the request fails or if size was equal to 0. If realloc() fails the original block is left untouched - it is not freed or moved.
CONFORMING TO
ANSI-C
SEE ALSO
brk(2)
NOTES proteced. | http://manpages.ubuntu.com/manpages/eoan/pt/man3/malloc.3.html | CC-MAIN-2020-34 | refinedweb | 117 | 61.16 |
12 September 2008 14:32 [Source: ICIS news]
LONDON (ICIS news)--Europe ethylene supply is so long cracker operators are having to resort to trimming operating rates and spot price ideas are falling rapidly, industry sources said on Friday.?xml:namespace>
“Storage tanks are filled up to the brim,” said an integrated player, adding “all crackers had been reduced”.
Supply has lengthened as poorer than expected demand has combined with good cracker reliability.
“Systems are full. One unplanned cracker stop has not made the slightest difference,” said another integrated industry source.
Polyethylene (PE) demand in particular, was very weak and described as “disastrous” by some sources.
Demand was down across the board, said other observers, pointing to the other ethylene derivative sectors such as ethylene glycol, glycol ethers.
Saudi Basic Industries Corp (SABIC) said on Thursday it had reduced rates at the cracker level because of reductions on its PE production.
Other integrated ethylene sources were describing their systems as “balanced”, which to some was a clear indication of reductions upstream and downstream.
“I do believe that the only correct way [to manage the length] is to moderate production,” said a producer.
“Customers don’t buy, no orders are coming in,” said one ethylene consumer.
Consumers down the chain were waiting to see what would be settled for fourth-quarter contracts, sources said.
Expectations that a decrease was on the cards was high, given the crude and naphtha developments since the settlement of the third-quarter contract price. Buyers are only taking what they needed in the meantime.
Spot ethylene activity was non-existent according to most sources.
Weak prices in Asia and in the ?xml:namespace>
Several European sources were sceptical over the recent reports that a second-half of September Iranian tender had been done into the Mediterranean at €1,060/tonne ($1,472/tonne) CIF (cost insurance freight)
“Either the deal has been done before [a while ago], or the number is not right,” said a Mediterranean-based producer.
“You can easily buy below this [€1,060/tonne] number,” one buyer said, adding there was just no outlet for spot ethylene at the moment.
“We could offer well below €1,000/tonne,” added a trader.
“It seems very difficult to place volumes in Asia nowadays, no demand, tanks are full [and] prices keep dropping through the floor,” said the trader, adding “it is not possible to place volumes in Europe unless pricing for Q4 [fourth quarter] and demand is more clear”.
Pipeline prices were notional but were being talked around €950/tonne FD (free delivered) NWE (northwest
This is down from numbers being posted at around €1,200-1,230/tonne just four weeks ago.
($1 = €0.72)
For more on ethylene please | http://www.icis.com/Articles/2008/09/12/9156075/europe-cracker-operators-trim-rates-on-long-supply.html | CC-MAIN-2014-49 | refinedweb | 456 | 60.04 |
I’m trying to get all the words made from the letters, ‘crbtfopkgevyqdzsh’ from a file called web2.txt. The posted cell below follows a block of code which improperly returned the whole run up to a full word e.g. for the word shocked it would return s, sh, sho, shoc, shock, shocke, shocked
So I tried a trie (know pun intended).
web2.txt is 2.5 MB in size, and contains 2,493,838 words of varying length. The trie in the cell below is breaking my Google Colab notebook. I even upgraded to Google Colab Pro, and then to Google Colab Pro+ to try and accommodate the block of code, but it’s still too much. Any more efficient ideas besides trie to get the same result?
# Find the words3 word list here: svnweb.freebsd.org/base/head/share/dict/web2?view=co trie = {} with open('/content/web2.txt') as words3: for word in words3: cur = trie for l in word: cur = cur.setdefault(l, {}) cur['word'] = True # defined if this node indicates a complete word def findWords(word, trie = trie, cur = '', words3 = []): for i, letter in enumerate(word): if letter in trie: if 'word' in trie[letter]: words3.append(cur) findWords(word, trie[letter], cur+letter, words3 ) # first example: findWords(word[:i] + word[i+1:], trie[letter], cur+letter, word_list ) return [word for word in words3 if word in words3] words3 = findWords("crbtfopkgevyqdzsh")
I’m using Pyhton3
>Solution :
A trie is overkill. There’s about 200 thousand words, so you can just make one pass through all of them to see if you can form the word using the letters in the base string.
This is a good use case for
collections.Counter, which gives us a clean way to get the frequencies (i.e. "counters") of the letters of an arbitrary string:
from collections import Counter base_counter = Counter("crbtfopkgevyqdzsh") with open("data.txt") as input_file: for line in input_file: line = line.rstrip() line_counter = Counter(line.lower()) # Can use <= instead if on Python 3.10 if line_counter & base_counter == line_counter: print(line) | https://devsolus.com/2022/06/23/trie-is-using-too-much-memory/ | CC-MAIN-2022-27 | refinedweb | 345 | 74.19 |
In-Depth
Many developers are worried about the compatibility of Silverlight with Metro-style applications. This project shows that those fears are overblown..
Enter Silverlight 2
Several years ago, Scott Guthrie, corporate vice president of Microsoft Server & Tools Business, posted a seven-part series he called "First Look at Silverlight 2". The series walked readers through building a Silverlight 2 application. Some of the important concepts taught in the series included:
At the end of the series, the completed project looked like Figure 1.
If the user clicked on an item, Figure 2 was the result.
Finally, clicking on the title would launch the default browser with the current story.
I was interested in seeing just how easy it would be to do a direct port of this code over to a Metro application. Note that I'm not trying to make this application fit the Metro guidelines in Windows 8. I simply want to run this as a Metro application in Windows 8 using C#/XAML.
The Initial Assessment
The first step was to download a completed version of Guthrie's Digg client sample, available here, and uncompress it to a temp folder. I then navigated to the \DiggSample_CSharp\DiggSample folder and inspected the files shown in Figure 3.
After looking through the file structure, I decided I'd need only the following files:
Download and Installation
Using the Windows 8 Developer Preview, I launched Visual Studio 11 and selected Windows Metro style/Application and named it DiggSample (just like the original project), as shown in Figure 4.
I decided to start with the DiggStory.cs file first because it was a simple class that wouldn't need any modification. Listing 1 shows the class.
Because my project is also named DiggSample, all I had to do was copy and paste the class into my project. Right off the bat I thought I'd have to fix my namespaces. Here are the default Metro application XML namespaces:
<Application xmlns=""
xmlns:x=""
x:
And the DiggStory Silverlight application XML namespaces:
<Application xmlns=""
xmlns:x=""
x:
The only difference is the first XML namespace. Because I'm creating a Metro application, I was able to leave the Metro application XML namespace untouched. The only thing I needed to do was copy <Application.Resources> out of the Silverlight application and into my Metro application.
I hit "build" and received the error shown in Figure 5.
After searching the Web, I found that RadialGradientBrush isn't included in the current build (the reasoning pertains to GPU acceleration, as explained in the MSDN Forums). Nor is it supported in the Microsoft .NET Framework 4.5.
Instead of the RadialGradientBrush, I decided to use the LinearGradientBrush for this sample.
I replaced this code:
<RadialGradientBrush GradientOrigin=".3, .3">
<GradientStop Color="#FFF" Offset=".15"/>
<GradientStop Color="#777" Offset="1"/>
</RadialGradientBrush>
With this:
<LinearGradientBrush>
<GradientStop Color="#FFF" Offset=".15"/>
<GradientStop Color="#777" Offset="1"/>
</LinearGradientBrush>
This resulted in a successful build.
Next, I added a new User Control called StoryDetailsView. I then opened the existing StoryDetailsView.xaml from the DiggStory solution and noticed the XML namespace was identical to the default Metro application. So I copied and pasted the entire StoryDetailsView.xaml inside my Metro application and hit "build" again. I was immediately greeted with the error shown in Figure 6.
There's an error stating that the NavigateUri doesn't exist on HyperlinkButton. It existed in Silverlight and Windows Phone, so where is it in WinRT?
This is where I discovered the differences in the XML namespaces being used. Hovering on top of the HyperlinkButton brings up the text shown in Figure 7.
This demonstrates that a Metro-based Hyperlink class inherits the ButtonBase class without any special properties or events, such as NavigateUri. I can quickly fix this by removing NavigateUri and adding a Click Event Handler that will navigate to the Web site in the default browser. Here's how to fix it:
<HyperlinkButton x:
Notice the Tag on the HyperlinkButton to pass the current URL. If I add the event handler and build the project again, it will compile successfully.
Next, I needed to add in our event handler for the HyperlinkButton and copy/paste the existing Close Button event handler:
void HyperlinkButton_Click(object sender, RoutedEventArgs e)
{
Windows.System.Launcher.LaunchDefaultProgram(
new Uri(hlbStoryTitle.Tag.ToString(), UriKind.RelativeOrAbsolute));
}
void CloseBtn_Click(object sender, RoutedEventArgs e)
{
Visibility = Visibility.Collapsed;
}
By using Windows.System.Launcher.LaunchDefaultProgram, I was able to pass it a URI so it automatically launches the default browser. This method can only be called from a click event or some other user interaction.
In Silverlight 2, the MainPage was just called Page.xaml. This changed in Silverlight 3 with the name MainPage.xaml (which is also what Metro applications use).
With that out of the way, let's look at the XML namespaces again.
The Page.xaml inside the Silverlight application looks like this:
<UserControl x:Class="DiggSample.Page"
xmlns=""
xmlns:x=""
xmlns:
I was able to copy and paste the entire Page.xaml inside of my MainPage.xaml file and fix the following namespaces for the Metro application:
<UserControl x:Class="DiggSample.MainPage"
xmlns=""
xmlns:x=""
xmlns:
Notice that DiggSample.Page turned into DiggSample.MainPage (remember what I said earlier about Silverlight 2?), and instead of using "clr-namespace" I used the "using" statement in WinRT applications.
If I run the application, it won't compile because I don't have event handlers set up for the buttons. That's OK for the meantime.
Here are the existing methods in MainPage.xaml.cs:
Initial Assessment of the Digg API
One thing I had to research was the Digg API. I assumed (correctly) that it had changed since 2008. But what had changed?
In Scott Guthrie's example, it calls the following URL:{0}?count=20&appkey=
Here, {0} is the name of the search term.
I tried that URL and found out it returns nothing. After reading the Digg API -- which is deprecated again -- I found that it's changed to the following:{0}&appkey=
Again, {0} is the name of the search term.
So I replaced the URL with the new one, leaving the appkey as is. (Request your own appkey if you're planning on using the digg API in your own applications.)
The next review item was the XML returned by the service, to see how well it matched the DisplayStories method. Listing 2 is sample XML returned by the Digg API using the service mentioned earlier.
I took each item from the DiggStory class, made sure it still existed and that the data type was correct. The only item that concerned me was the ID, as Guthrie's sample code cast ID as an integer. From looking at some random sample data it appears the ID is no longer an integer. I did several Google searches and others had hit this issue and recommended using a string, which I did.
The Search Button Event Handler
The existing search button event handler looked like Listing 3 in Silverlight.
I changed it to what's shown in Listing 4.
The only differences are marking the method as async, and instead of using WebClient I used HttpClient, and for the response I used HttpResponseMessage. I then passed the responseString into the existing DisplayStories that Guthrie had built. The DiggService_DownloadStoriesCompleted method was no longer needed, so it was removed.
DisplayStories Method
Because I knew I'd have problems with ID, I simply changed it from an integer to a string, as shown in Listing 5.
This caused a ripple effect and broke DiggStory.cs, so I changed ID to a string here as well. The result is shown in Listing 6.
I was all set, so I built the solution and everything compiled successfully.
Then the moment of truth: Run it!
After running the application, it appeared just like it did with the Silverlight application. Figure 8 shows the UI, waiting for input.
I typed "Microsoft" into the search box and noticed I had the clear text option as well.
I then hit "Search"; the results are shown in Figure 9.
I then selected an item and got the window shown in Figure 10.
Clicking on an item title will launch the story in Internet Explorer.
I then took Guthrie's existing Silverlight 2 application and updated the Digg API; it immediately worked in the Windows 8 Desktop Mode.
The Best of Both Worlds
Every Microsoft-focused developer should be learning about Metro applications. It's also important that Silverlight developers begin to understand how to work with this new technology using their existing skillset.
What did I learn from this exercise?
Silverlight developers have the best of both worlds. They can create an application in native Silverlight and easily port it to Metro, or run it on the Windows 8 Desktop. HTML5 developers don't get this luxury. | https://visualstudiomagazine.com/articles/2012/03/01/from-silverlight-to-metro.aspx | CC-MAIN-2020-34 | refinedweb | 1,486 | 57.98 |
> I'm having a difficult time trying to understand modules > with python. I used to write php applications and am used > to including files In Python you don't include files you import names. This is an important distinction. > My problem is, I don't know how to write a module. > I have read the manuals and it just doesn't make sense yet. OK, I dunno which bits you read but a module in Python is just a file full of python code. Lets call it mymodule.py If you do import mymodule you make the name of the module available in your file. At the same time Python will execute the file and thus any function or class definitions will be executed and the functions and classes will be available for use. BUT their names will be inside the mymodule object. To access anything inside the module you need to prepend it with the module object name: mymodule.myfunction() If the file name is long you might like to rename the module by importing it like this: import mymodule as m Now we can access the function like this: m.myfunction() The module object remains the same we have just given it a shorter name. The other way to get at the contents of a module is to do this: from mymodule import myfunction This brings the name myfunction into your file but not the name mymodule nor any of the other names within mymodule. You can also "from mymodule import *" but that's usually a bad idea since it brings all the names from mymodule into your file, potentially overwriting some of them. > Ultimately I'd like to create 2 "include files". Two modules > 1 will be a class file that I plan to reuse throughout my application This is a good idea. > 1 file will be a list of variables. THis is an extremely bad idea. The whole idea of modules controlling names is to avoid global variables spilling over from one module to another. Its much better to keep the variables within the modules where they are needed. You can access them by prefixing with the parent module's name. > I tried create a file and putting it in my /python/lib > directory and importing it. Surprisingly I was able to > import it but I was unable to access the variables or > methods in the file. AS I described above you import the name of the module into your local namespace. You do not import the file itself. Thats why we "import mymodule" and not "mymodule.py" > Perhaps I should use something else for code reuse? You have the right idea but just need to adapt from the C/C++/PHP style of copy n paste include to the more theoretically sound importing of names. You might like to read both the modules and namespaces topics in my tutorial. Alan G Author of the Learn to Program web tutor | http://mail.python.org/pipermail/tutor/2004-February/028070.html | CC-MAIN-2013-20 | refinedweb | 494 | 72.66 |
. To view the
contents of the
search package, see the
search package reference.
- Time Field - a
time.Timevalue (stored with millisecond precision)
- Geopoint Field - a data object with latitude and longitude coordinates
The maximum size of a document is 1 MB.
Indexes
An index stores documents for retrieval. You can retrieve a single document by its ID, a range of documents with consecutive IDs, or all the documents in an index. You can also search an index to retrieve documents that satisfy given criteria on fields and their values, specified as a query string. You can manage groups of documents by putting them into separate indexes.
There is no limit to the number of documents in an index or the number of indexes you can use. The total size of all the documents in a single index is limited to 10GB by default but may be increased to up to 200GB by submitting a request.":
index.Search(ctx, "rose water", nil)
This one searches for documents with date fields that contain the date July 4, 1776, or text fields that include the string "1776-07-04":
index.Search(ctx, "1776-07-04", nil):
// search for documents with pianos that cost less than $5000 index.Search(ctx, "Product = piano AND Price < 5000", nil)
Searchcall returns an
Iteratorvalue, which may be used to return the complete set of matching documents.
Additional training material
In addition to this documentation, you can read the two-part training class on the Search API at the Google Developer's Academy. (Although the class uses the Python API, you may find the additional discussion of the Search concepts useful.)
Documents and fieldsDocuments are represented by Go structs, comprising a list of fields. Documents can also be represented by any type implementing the
FieldLoadSaverinterface.
Document identifier
Every document in an index must have a unique document identifier, or
docID.
The identifier can be used to retrieve a document from an index without performing
a search. By default, the Search API automatically generates a
docID when
a document is created. You can also specify the
docID yourself when you
create a document. A
docIDID in a search. Consider this scenario: You
have an index with documents that represent parts, using the part's serial
number as the
docID..
- Time Field - a
time.Timevalue (stored with millisecond precision)
- Geopoint Field: A point on earth described by latitude and longitude coordinates
The string field types are Go's built-in
string type and the
search package's
HTML and
Atom
types. Number fields are represented with Go's built-in
float64
type, time fields use the
time.Time type,
and geopoint fields use the
appengine package's
GeoPoint type.
Special treatment of string and time fields
When a document with time,".
Time field accuracyWhen you create a time field in a document you set its value to a
time.Time. For the purpose of indexing and searching the time field, any time component is ignored and the date is converted to the number of days since 1/1/1970 UTC. This means that even though a time field can contain a precise time value a date query can only specify a time field value in the form yyyy-mm-dd. This also means the sorted order of time fields with the same date is not well-defined. While the
time.Timetype represents time with nanosecond precision, the Search API stores them with only millisecond precision..
See the
DocumentMetadata reference for more information about setting rank.
The Language property of the
Field struct specifies the language in which that field is encoded.
Linking from a document to other resources
You can use a document's
docID and other fields as links to other
resources in your application. For example, if you use
Blobstore you can associate the
document with a specific blob by setting the
docID or the value of an
Atom field to the BlobKey of the data.
Creating a document
The following code sample shows how to create a document object. The
User type specifies the document structure, and a
User value is constructed in the usual way.
import ( "fmt" "net/http" "time" "golang.org/x/net/context" "google.golang.org/appengine" "google.golang.org/appengine/search" ) type User struct { Name string Comment search.HTML Visits float64 LastVisit time.Time Birthday time.Time } func putHandler(w http.ResponseWriter, r *http.Request) { id := "PA6-5000" user := &User{ Name: "Joe Jackson", Comment: "this is <em>marked up</em> text", Visits: 7, LastVisit: time.Now(), Birthday: time.Date(1960, time.June, 19, 0, 0, 0, 0, nil), } // ...
Working with an index
Putting documents in an index
When you put a document into an index, the document is copied to persistent storage and each of its fields is indexed according to its name, type, and the
docID.
The following code example shows how to access an Index and put a document into it.
// ... ctx := appengine.NewContext(r) index, err := search.Open("users") if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } _, err = index.Put(ctx, id, user) if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } fmt.Fprint(w, "OK")
When you put a document into an index and the index already contains a document with the same
docID, the new document replaces the old one. No warning is given. You can call
Index.Get before creating or adding a document to an index to check whether a specific
docID already exists.
The
Put method returns a
docID. If you did not specify the
docID yourself, you can examine the result to discover the
docID that was generated:
id, err = index.Put(ctx, "", user) if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } fmt.Fprint(w, id)
Note that creating an instance of the
Index type does not guarantee that a persistent index actually exists. A persistent index is created the first time you add a document to it with the
put method.
Updating documents
A document cannot be changed once you've added it to an index. You can't add or remove fields, or change a field's value. However, you can replace the document with a new document that has the same
docID.
Retrieving documents by docID
Use the
Index.Get method to retrieve a document from an index by its
docID:
func getHandler(w http.ResponseWriter, r *http.Request) { ctx := appengine.NewContext(r) index, err := search.Open("users") if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } id := "PA6-5000" var user User if err := index.Get(ctx, id, &user); err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } fmt.Fprint(w, "Retrieved document: ", user) }
Searching for documents by their contents
To retrieve documents from an index, you construct a query string and call
Index.Search.
Search returns an iterator that yields matching documents in order of decreasing rank.
func searchHandler(w http.ResponseWriter, r *http.Request) { ctx := appengine.NewContext(r) index, err := search.Open("myIndex") if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } for t := index.Search(ctx, "Product: piano AND Price < 5000", nil); ; { var doc Doc id, err := t.Next(&doc) if err == search.Done { break } if err != nil { fmt.Fprintf(w, "Search error: %v\n", err) break } fmt.Fprintf(w, "%s -> %#v\n", id, doc) } }
Deleting documents from an index
You can delete documents in an index by specifying the
docID of the document you wish to delete to the
Index.Delete method.
func deleteHandler(w http.ResponseWriter, r *http.Request) { ctx := appengine.NewContext(r) index, err := search.Open("users") if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } id := "PA6-5000" err = index.Delete(ctx, id) if err != nil { http.Error(w, err.Error(), http.StatusInternalServerError) return } fmt.Fprint(w, "Deleted document: ", id) } Platform Console
In the Cloud Platform:
Index.Get:
If you enable billing for your app you will be charged for additional usage beyond free quotas. The following charges apply to billed apps:
Additional information on pricing is on the Pricing page. | https://cloud.google.com/appengine/docs/standard/go/search/ | CC-MAIN-2017-13 | refinedweb | 1,343 | 59.5 |
Suppose your task takes about 20 seconds to finish before responding your client. Imagine you are the user of your application. It happens that a lot that processing can be actually be spared until later time whenever user makes a request to your site. AJAX is one way of doing tasks asynchronously, but we want to run our Python code asynchronously. Therefore, we resort to using Task Queue and Message Broker.
The typical process flow of a request to Django app:
Say we want to fetch some data externally and process them whenever there is an update. Sounds familiar right? Yes, you can think of it as a Webhook on your CI server.
In this post, I won't be discussing about why I choose Redis over other message broker like RabbitMQ, ActiveMQ or Kafka. The scope of this post is about applying task queue to facilitate execution of asynchronous task in Django. If you new to task queue, have no idea how to implement async tasks, or looking for solution to integrate Celery with Django, keep reading!
First, make sure you installed Celery and Redis interface, you can do so by downloading from PyPi.
pip install celery redis
Next, install Redis Server, you can refer to this post from DigitalOcean.
If you are running on Docker, simply 'up' a Redis container using image in Docker Hub.
Initially, this is the structure of our project for demonstration:
. ├── api │ ├── apps.py │ ├── __init__.py │ └── views.py ├── django_with_celery │ ├── __init__.py │ ├── settings.py │ ├── urls.py │ └── wsgi.py └── manage.py
Let us add a URL entry and a View into our Django project.
# django_with_celery/urls.py from django.conf.urls import url from api.views import BuildTrigger urlpatterns = [ url(r'^api/trigger_build/', BuildTrigger.as_view()), ]
# api/views.py from rest_framework.views import APIView from rest_framework.response import Response class BuildTrigger(APIView): def post(self, request): build_something() # This would take 1 minute to finish return Response(None, status=201)
From the BuildTrigger View, build_something() takes about a minute to finish execution. The whole process from sending Http request from client to receiving a response would definitely takes more than a minute. It is likely the HTTP client drop this connection if response time > connection timeout. Since the endpoint is to trigger a build, we should can run it build_something() after responding.
To perform tasks asynchronously, we use a task queue to queue all pending tasks. In our case, we will use Celery, an asynchronous task queue based on distributed message passing and Redis as the message broker.
To integrate Celery with Django, create a __init__.py in the project root directory. Then another Python file celery.py in your django_with_celery app directory.
In your celery.py, add the following code:
# django_with_celery/celery.py from __future__ import absolute_import import os from celery import Celery os.environ.setdefault('DJANGO_SETTINGS_MODULE', 'django_with_celery.settings') # DON'T FORGET TO CHANGE THIS ACCORDINGLY app = Celery('django_with_celery') app.config_from_object('django.conf:settings', namespace='CELERY') app.autodiscover_tasks()
In celery.py, we define the environment variable DJANGO_SETTINGS_MODULE. The last line, autodiscover_tasks() will run through all our modules and look for asynchronous task.
Next, we define these in our __init__.py of our project.
#./__init__.py from __future__ import absolute_import, unicode_literals from django_with_celery.celery import app as celery_app __all__ = ['celery_app']
After adding these codes, add the following variable into your main settings.py, in our case, the _django_withcelery/settings.py.
CELERY_BROKER_URL = 'redis://localhost'
This would define the host of our Redis instance. Celery will look for variables with 'CELERY_' prefix in the settings.py defined in system environment.
Now, all our integration is done but definition of async tasks. To define an async task, simply import and add the decorator @shared_task to each method or function.
from celery import shared_task def build_something(): # some code here
You may find some tutorial suggest you to define all async task in a separate module. Well, it is entirely up to you, as by enabling autodisover, Celery will look for all task with @shared_task decorator.
By adding @shared_task decorator, you method can now run asynchronously, but it doesn't run naturally. We have to call the method in a way telling it to run asynchronously. To do so, simply call your method with the suffix apply_async() or delay()
build_something.apply_async() # OR build_something.delay()
There are some differences between the two method regarding configurability. You can refer to Celery documentation for more details.
Until this step, all codes required to run tasks asynchronously are done, but you will need few more step to let your tasks run properly.
Make sure your Redis is up and running. Run redis_server to start your server if you are running it in your local machine. You can also run redis_cli to attempt connection to your Redis server.
Open your Terminal. Run the following command from your project root:
celery -A django_with_celery.celery worker -l DEBUG -E
This will spawn a worker for our app.
Now you should be able to run your tasks, whenever a task is queued into Celery, it will be logged to your console running command from above.
Flower is a monitoring tool for Celery. You can learn more about it from their GitHub. It provides real-time monitoring to your Celery clusters, remote control, broker monitoring, HTTP API, etc.
First published on 2017-10-31
Republished on Hackernoon | https://melvinkoh.me/asynchronous-tasks-with-celery-redis-in-django-cjye4tgaw000luns1ngthq609?guid=none | CC-MAIN-2020-29 | refinedweb | 885 | 59.5 |
Introduction
XML's status in databases has changed in the last couple of years from a temporary worker to that of a first class citizen. No longer does it need to morph its identity in order to fit into the relational world. It proudly maintains its hierarchical heritage, even while exploiting the power and stability of the relational database world. In fact, some of its relational neighbors have adapted techniques that make them look like XML in order to exploit the richness of the hierarchical XML model.
This article showcases how the new XML storage and query environment plays into the XML data model from Part 1. It shows how once you adapt to the new XML-based application development architecture, your database schemas become much simpler and more natural. It also demonstrates how querying the XML data in the database is no different from querying the data in the application. Finally, it shows you how to marry the relational data with the XML data to get best of both the worlds.
XML database basics
While most of the major relational databases have some support for XML, DB2's pureXML™ support is much more robust and efficient, making it an ideal database to test out the XML programming model. This article I focuses on how to exploit the improved database support for XML in your application architecture.
DB2 allows you to store, query, manipulate, and publish:
- Relational data — SQL
- Relational data as XML — SQL/XML
- XML data — XQuery
- Hybrid data (Relational & XML) — SQL/XML and XQuery
Figure 1. DB2 hybrid storage
Store XML in the database
The main advantage of the XML support in the relational database is that you can save both relational and XML data in the same table. And although internally the XML is stored in a hierarchical (tree) format, logically in the database table it appears to be stored in a single column (like a CLOB or BLOB).
From the data objects in Part 1, you see that there are two tables with at least two columns each.
Listing 1. Tables
CREATE TABLE CUSTOMER_TABLE ( CUSTOMERID CHARACTER (12) NOT NULL, CUSTXML XML NOT NULL , CONSTRAINT CC1183665042494 PRIMARY KEY ( CUSTOMERID) ) CREATE TABLE PURCHASE_TABLE ( CUSTOMERID CHARACTER (12) NOT NULL , ITEMXML XML NOT NULL , CONSTRAINT CC1183665244645 FOREIGN KEY (CUSTOMERID) REFERENCES CUSTOMER_TABLE (CUSTOMERID) ON DELETE CASCADE ON UPDATE NO ACTION ENFORCED ENABLE QUERY OPTIMIZATION )
It is obvious from the above statements that by storing an application's data object as XML data, the relational schemas simplify to a greatly. Plus, the fact that the infrastructure is still relational allows the XML data to leverage the proven capabilities of the relational database like triggers, constraints, and foreign key relationships.
Since logically the XML column appears the same as a VARCHAR, CLOB, or BLOB column, the INSERT statements are also similar.
insert into CUSTOMER_TABLE values('hardeep', '<Customer customerid="hardeep" firstname="hardeep" lastname="singh"/>')
Or if you were inserting from a Java™ program:
Listing 2. Inserting from a Java program
String insertsql= "insert into PURCHASE_TABLE values(?,?)"; PreparedStatement iStmt=connection.prepareStatement(insertsql); File inputfile= new File(filename); //filename is the path of the XML file long filesize=inputfile.length(); BufferedReader in = new BufferedReader(new FileReader(inputfile)); iStmt.setCharacterStream(1,in,(int)filesize); int rc= iStmt.executeUpdate();
In order to better understand the hybrid storage, look at a view of how the XML data logically appears to be stored inside a relational database.
Note: Even if the physical storage technology for XML might differ for different relational database vendors, the logical view is similar.
Figure 2. DB2 Hybrid storage logical view
Query the XML
When you expand the database schema model you can see the relational tables and columns. If you drill further into an XML column, the schema transitions from the relational model to the hierarchical one for XML. Now, if you get over the fact that there are two schemas, a relational schema and an XML schema, and just consider them to be one, then you can navigate and query into the unified schema in a more natural manner.
In the unified schema shown in Listing 1, if you wanted to get the data in the CUSTXML column of the CUSTOMER_TABLE, you would identify the path to the CUSTXML column as your target in your query.
SELECT CUSTXML FROM CUSTOMER_TABLE where customerid='hardeep';
This returns the customer data inside the CUSTXML column for hardeep.
Now consider the case where you want customer data where lastname of the customer is singh. In this case, you need to identify the path to the lastname attribute in each XML document (CUSTOMER_TABLE.CUSTXML/Customer/@lastname) and check to see if it is singh.
In a perfect world, the query would be
Select * from CUSTOMER_TABLE where CUSTXML/Customer/@lastname='singh'. However, in the real world you need to formulate it in a syntax that is understood by the database query engine. A new language called XQuery, which can be used to query XML documents, has been introduced to the database world. SQL has been updated to add new functions that can understand this new language and bridge the two worlds. So a query that searches for customers with the last name singh would now look like:
select CUSTXML from CUSTOMER_TABLE where xmlexists ('$cust/Customer[@lastname= "singh" ]' passing CUSTXML AS "cust" )
Or if you were making this call from a Java program using a parametrised query:
select CUSTXML from CUSTOMER_TABLE where xmlexists ('$cust/Customer[@lastname= $lname ]' passing CUSTXML AS "cust" , cast(? as VARCHAR(12)) as "lname")
Once you get over the funny syntax of passing parameters to the SQL/XML functions, you will find that for basic hybrid queries over relational and XML data, the XML queries contain mostly XPath statements. This is quite similar to what you were doing in the application layer (in Part 1) for the XML data model, where much of your code was making XPath calls to the document object model (DOM) wrapper to query and manipulate the XML data.
Note: In Viper 2, some simplification has been done regarding parameter passing to some of the SQL/XML function. For example, in the previous query the XMLExists passing clause does not specify the CUSTXML column.
select CUSTXML from CUSTOMER_TABLE where xmlexists ('$CUSTXML/Customer[@lastname= $lname ]' passing cast(? as VARCHAR(12)) as "lname")
Push application logic to the database
XQuery has all the rudimentary functionality of most high level languages (if-then-else, for, variables, functions, and arithmetic operators). This makes it possible to embed business logic inside the query. Plus, it has a lot of common functionality mapping to XSLT making it possible to not only query but also transform the XML output right in the database.
Take the Customer example for the XML data model from Part 1.
<Customer customerid ="" firstname="" lastname="" > <Items><Item ID="" description="" purchaseDate="" price="" /></Items> </Customer>
Replace application code with DB2 query
Instead of merging the XML data from the two tables in the application layer, you can do the same thing in the database using a single SQL/XML query. A one-to-many join of
CUSTOMER_TABLE.CUSTXML/Customer/@customerid to
PURCHASE_TABLE.ITEMXML/Customer/@customerid.
Figure 3. Join two XML columns
Listing 3. Query two XML columns
values(xmlquery(' for $Customer in db2-fn:xmlcolumn( "CUSTOMER_TABLE.CUSTXML")/Customer where $Customer/@customerid= $customerid return <Customer customerid ="{$Customer/@customerid}" firstname ="{$Customer/@firstname}" lastname ="{$Customer/@lastname}" >{ for $Customer0 in db2-fn:xmlcolumn("PURCHASE_TABLE.ITEMXML")/Customer where $Customer0/@customerid= $Customer/@customerid return $Customer0/Item }</Customer> ' passing cast( ? AS varchar(255) ) as "customerid" ))
The resulting XML for all items purchased by customer hardeep would be:
Figure 4. Query result
In the above query, you had to construct the outer Customer element and add the attributes from the CUSTXML column data. DB2 Viper 2 (beta) has support for XQuery updating expressions that enable modifications of the XML document so there is no need to construct the outer Customer element. Instead, you could use the one from the customer table and insert the items from the purchase table as children.
Listing 4. Viper 2 query for two XML columns hardeep as "customerid" ))
In the above queries, you not only searched, retrieved, and merged parts of XML documents stored in the database but you also transformed the resulting XML by adding new elements to it. Also, hardeep was implicitly cast to XML type (xs:string).
Comparison between the database query and Java application code
If you compare the above queries to the Java code (Listing 6. Rewriting the application to use the XML model) in Part 1, you find that the logic is quite similar.
- Select the Customer info from CUSTOMER_TABLE.
- Construct an Items element and search for all the items purchased by that customer from PURCHASE_TABLE.
- Iterate over each item in the selected list and insert it into the Items element.
- Insert the Items element into the Customer element.
Create a stored procedure
To separate the business logic in the database from the application code, it is a good idea to create a stored procedure for this query.
Listing 5. Create procedure
CREATE PROCEDURE customerItems(IN custid varchar(12)) DYNAMIC RESULT SETS 1 LANGUAGE SQL BEGIN DECLARE c_cur CURSOR WITH RETURN FOR custid as "customerid" )) OPEN c_cur; END
Replace the application code with stored procedure call
The application code now makes a stored procedure call to DB2 and passes the XML to the DOM wrapper. The application code for the XML model (Listing 6. Rewriting the application to use the XML model lines 2-8) in Part 1 would reduce to:
2. ResultSet dbResult = dbstmt.executeQuery("call customerItems ("+custid+")" 3. XMLParse customerXML = new XMLParse(dbResult. getString(1));
A more elaborate example
Consider a little more elaborate scenario that also calculates the insurance on each item. To make it a little more challenging, the insurance not only varies on a daily basis but also changes with price. This means that you have to pass to the query not only the customerid but also the insurance rates. Now assume that you query the latest insurance rates every day from a Web service provided by the insurance company. The insurance rate information comes as an XML document.
<insurance> <rate price="100" currency="$" rate=".02"/> <rate price="500" currency="$" rate=".018"/> <rate price="" currency="$" rate=".015"/> </insurance>
You can modify the previous stored procedure to calculate insurance rates.
Listing 6. Stored procedure that also calculates insurance for each item
CREATE PROCEDURE customerItemsWithInsurance(IN custid varchar(12), rate XML) DYNAMIC RESULT SETS 1 LANGUAGE SQL BEGIN DECLARE c_cur CURSOR WITH RETURN FOR values(xmlquery(' for $Customer in db2-fn:xmlcolumn( "CUSTOMER_TABLE.CUSTXML")/Customer let $items:=( <Items>{ for $Customer0 in db2-fn:xmlcolumn("PURCHASE_TABLE.ITEMXML")/Customer let $insurance:=<insurance currency="{($rate//rate[@ {( if($Customer0/Item/@price > 500) then ( $Customer0/Item/@price * $rate//rate[@price=""]/@rate ) else ( if($Customer0/Item/@price > 100) then ( $Customer0/Item/@price * $rate//rate[@price="500"]/@rate ) else ( $Customer0/Item/@price * $rate//rate[@price="100"]/@rate ) ) )}</insurance> where $Customer0/@customerid= $Customer/@customerid return transform copy $item:=$Customer0/Item modify( do insert $insurance as last into $item) return $item }</Items> ) where $Customer/@customerid= $customerid return transform copy $cust:=$Customer modify(do insert $items as last into $cust) return $cust ' passing custid as "customerid", rate as "rate" )); OPEN c_cur; END
The call to the stored procedure takes in two runtime parameters, the customerid and the insurance XML.
call customerItemsWithInsurance(?,?)
It is obvious from the above example that if the data being manipulated in the database is in XML format, then the power of XQuery can be leveraged to implement more of the business logic than was previously possible using SQL alone. Also, it is clear that the XML that is being used in the query does not even need to exist in the database. Thus, XML data participating in a SQL/XML query can either be stored in the database in its pure (hierarchical) form, it can be generated by using SQL/XML function, or it can even be passed as a runtime parameter to the query. The distinction between the database and an application server is gradually being blurred.
Pros and cons
Like every new technology, there will be teething problems. Some are due to fact that the implementations are in their first version and others because of inertia to change from the true and tried methodologies that you are comfortable with.
- Performance though improving is still not at par with the relational data.
- XQuery is a new language and some of the SQL/XML functions have a syntax that takes getting used to.
- There is a lot of legacy data already in relational format.
- Most critical is the fact that this is a new way of creating business applications and data schemas, different from the current way of object-oriented-based applications and normalized relation schemas.
- There are not many tools that can debug and optimize these kinds of queries for better performance.
Pitted against these odds are the facts that the new model is more natural in the way it manages the data. The business data information is maintained and manipulated intact in both the application and database layers, and as you will see in Part 3, even in the client layer.
- Even though the surrounding languages might be different (Java, XQuery, JavaScript, PHP) the language used to traverse the XML document is the same (XPath) in all the layers.
- Although legacy data is relational, it can easily be queried and morphed to XML using some of the new SQL/XML function introduced in Viper II . Looking at the example from Part 1, "Case II all data stored in the database as relational." The query can be simplified using the new XMLROW function introduced in Viper 2.
Select XMLROW (customerid, firstname, lastname OPTION as attributes ROW Customer) from customer_table where customerid=?
You can create joins between relational and XML data also. In this example scenario, if you had a third table containing product description of the purchased items and this was a relational table, then you could get the product description for each item purchased by doing a join using the item ID.
Figure 5. Joining relational and XML columns
Select details, weight from SQLPRODUCT, ITEM_TABLE where xmlexists ('$itemxml/item[@itemid=$pid]' passing ITEM_TABLE.ITEMXML AS "itemxml", SQLPRODUCT.PID AS "pid" )
In DB2 9, you are able to pass runtime parameters to the XQuery embedded in the SQL statement using the
passingclause but you could not do the same for SQL embedded inside an XQuery. In Viper 2, this limitation has been removed and now you are able to pass a runtime variable to a relational query embedded inside the XQuery.
Listing 7. Pass the runtime variable to SQL embedded inside an XQuery
values(xmlquery(' for $Customer0 in db2-fn:xmlcolumn("PURCHASE_TABLE.ITEMXML")/Customer where $Customer0/@customerid= $custid return ( $Customer0/Item, db2-fn:sqlquery( ''select xmlrow(details, description, weight option ROW "description") from sqlproduct where pid= parameter(1)'', $Customer0/Item/@ID)) ' passing cast( ? AS varchar(255) ) as "custid" ))
Thus, even if some of the data is in relational tables and some is in XML you can now make dynamic joins between the XML and relational data from inside either the SQL query or the XQuery or both.
- Even performance might not be a big issue in some cases since:
- You are able to create XPath expression-based indexes on the XML documents stored in the database.
create index custfname on customer_table(info) generate key using xmlpattern '/Customer/@firstname' as sql varchar(64)
- The numbers of joins required are reduced since the databases schemas are simpler.
- I/O may be reduced since now you can massage the data inside the query before you send it to the application.
- You can always extract out key information from an XML document to relational columns using SQL/XML functions like XMLTable and create relational indexes on them.
- You can create text search indexes on the XML document.
Conclusion
XML is here to stay. Most industries and government organizations are standardizing their XML schemas and are insisting on dealing with electronic documents that conform to these schemas. Since B2B data exchanged over the wire is now in XML, why not store that data as is (pureXML) in the database? Once you store the data as XML, you can index, query, validate, manipulate, transform, and update it using XQuery and standard SQL/XML. As you push more application logic into the query, your database becomes an active participant in the service-oriented architecture (SOA) world by publishing its stored procedures as Web services and feeds.
"The old order changeth, yielding place to new." Morte d'Arthur
Resources
Learn
- "ISV success with DB2 Viper": Prepare your applications, routines, and scripts for migration to DB2 Viper.
- Technical articles on DB2 XML: Find more articles regarding DB2 and XML.
- "Get off to a fast start with DB2 Viper" (developerWorks, March 2006): Create database objects for managing your XML data and how to populate your DB2 database with XML data.
- "Query DB2 XML Data with SQL" (developerWorks, March 2006): Query data stored in XML columns using SQL and SQL/XML.
- "Query DB2 XML data with XQuery" (developerWorks, April 2006): Query data stored in XML columns using XQuery.
- XML Programming with PHP and Ajax: Put DB2 9's XML capabilities to work in service-oriented architectures and other business scenarios.
- "Use DB2 native XML with PHP" (developerWorks, Aug 2005): Learn about the effectiveness of using the native XML capabilities coming in the next version of DB2 Universal Database for Linux, UNIX, and Windows to simplify application code and the relational schemas.
- "Native XML Support in DB2 Universal Database": Compare and contrast DB2's new XML support with traditional relational database technology.
- developerWorks Information Management zone: Learn more about DB2. Find technical documentation, how-to articles, education, downloads, product information, and more.
- Stay current with developerWorks technical events and webcasts.
Get products and technologies
- Download DB2 Viper 2 open beta.
-. | http://www.ibm.com/developerworks/data/library/techarticle/dm-0708singh/index.html | CC-MAIN-2015-35 | refinedweb | 2,980 | 50.16 |
public class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; } }
I have encountered a test case {-1,1,1,1,2,3} where expected output is 1. However question description states majority element should be more than [n/2].
Thus if we have another test case {1,1,1,2,3,4} this method won't work.
class Solution { public: int majorityElement(vector<int>& nums) { sort(nums.begin(),nums.end()); int n = nums.size(); return nums[n/2]; } };
Sorting will take O(nlogn) time, but we can do it in O(n).
Edit: we are assuming that majority will be more that half(not exactly half).
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect. | https://discuss.leetcode.com/topic/37240/two-line-solution-the-easiest-one | CC-MAIN-2018-05 | refinedweb | 128 | 61.53 |
Type: Posts; User: chuckm
Done. Good idea. Thanks.
I found that some of my splitcontainers were changing sizes and the splitterdistance changing. Alltough I have no idea why yet.
There's no message. Both form1.h in the designer and in the code view show that they have modifications (asterisk in tab beside file name) although no changes have been made.
Sorry if this is not the correct forum for this question but none of the other alternatives seemed more appropriate.
Basically I have a C++ .NET project in VS2010. Over time it's become quite...
I'm trying to use this control in a .NET managed C++ application. I'm having trouble getting access to the System::Windows::Controls namespace.
Any help is appreciated.
Chuck
Here's my code
Process^ myProcess = gcnew Process;
myProcess->StartInfo->FileName = "c:\\myfile.htm";
myProcess->Start();
This works as expected when I run from the debugger. Nothing...
I know there are a few people out there that still use BC Builder and I'm hoping one reads this.
I'm using Builder 6.0 and am trying to get 48x48 images into a TImageList for use in a TListView...
Thank You ..... I'm working on it now .... Chuck
I am working on an application that needs the ability to download files from the internet to the local hard drive. It doesn't need the ability to upload them, strictly download. Is there a simple way... | http://forums.codeguru.com/search.php?s=695757392c28e928e968dab18ae03266&searchid=8423879 | CC-MAIN-2016-07 | refinedweb | 241 | 78.14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.