Search Results

Search found 4273 results on 171 pages for 'shift reduce'.

Page 112/171 | < Previous Page | 108 109 110 111 112 113 114 115 116 117 118 119  | Next Page >

• WPF: Hidden parent and visible child

  - by oakskc

  As of last night, I decided to start learning about WPF and have been reading through a number of online tutorials and books. This is a huge shift. One feature that has fascinated me is the implicit property value inheritance. I know in the WinForms world, if a control is not visible then neither are any of the child controls. Same seems to be true in the WPF world, as expected. I wondered if explicitly setting the child control's Visibility property would allow for an invisible parent and visible child and it did not. Is this something that would be possible in WPF? Can you have a container control that is hidden with visible children? This is more an exercise of curiosity than anything. I'm still trying to wrap my head around a lot of what I've been reading.

  Read the article

• MapReduce results seem limited to 100?

  - by user1813867

  I'm playing around with Map Reduce in MongoDB and python and I've run into a strange limitation. I'm just trying to count the number of "book" records. It works when there are less than 100 records but when it goes over 100 records the count resets for some reason. Here is my MR code and some sample outputs: var M = function () { book = this.book; emit(book, {count : 1}); } var R = function (key, values) { var sum = 0; values.forEach(function(x) { sum += 1; }); var result = { count : sum }; return result; } MR output when record count is 99: {u'_id': u'superiors', u'value': {u'count': 99}} MR output when record count is 101: {u'_id': u'superiors', u'value': {u'count': 2.0}} Any ideas?

  Read the article

• Image rotate to mouse using Jquery and CSS

  - by James

  I have a compass image and am trying to get the needle to follow the mouse around the page, exactly how the images are rotated in the following demo but without having to shift and click. I'm having trouble breaking down that code however, so any help would be most appreciated. Thanks in advance. http://www.elated.com/res/File/articles/development/javascript/jquery/smooth-rotatable-images-css3-jquery/ The images are simply wrapped in a div <div id="content"> <img id="compass" src="compass.png"/> <img id="needle" src="needle.png"/> </div>

  Read the article

• How can I access the sign bit of a number in C++?

  - by Keand64

  I want to be able to access the sign bit of a number in C++. My current code looks something like this: int sign bit = number >> 31; That appears to work, giving me 0 for positive numbers and -1 for negative numbers. However, I don't see how I get -1 for negative numbers: if 12 is 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1100 then -12 is 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0011 and shifting it 31 bits would make 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 which is 1, not -1, so why do I get -1 when I shift it?

  Read the article

• Performing time consuming operation on STL container within a lock

  - by Ashley

  I have an unordered_map of an unordered_map which stores a pointer of objects. The unordered map is being shared by multiple threads. I need to iterate through each object and perform some time consuming operation (like sending it through network etc) . How could I lock the multiple unordered_map so that it won't blocked for too long? typedef std::unordered_map<string, classA*>MAP1; typedef std::unordered_map<int, MAP1*>MAP2; MAP2 map2; pthread_mutex_lock(&mutexA) //how could I lock the maps? Could I reduce the lock granularity? for(MAP2::iterator it2 = map2.begin; it2 != map2.end; it2++) { for(MAP1::iterator it1 = *(it2->second).begin(); it1 != *(it2->second).end(); it1++) { //perform some time consuming operation on it1->second eg sendToNetwork(*(it1->second)); } } pthread_mutex_unlock(&mutexA)

  Read the article

• Bit conversion operations in PHP

  - by Goro

  Hello, I find myself in need of performing bit-level conversion on variables in PHP. In more detail, I have a bit stream that is read as an integer by hardware, and I need to do some operations on the bits to make it into what its actually supposed to be (a float). I have to do this a few times for different formats, and the functionality I need is Being able to select and move individual bits in a variable Being able to cast statically one type of variable to the other (ie. int to float) I know php natively supports bitwise AND, OR, etc, and shift operations, but I was wondering if: there may already be a library in php that does this sort of thing I would be better off with delegating the calculations to some other language Thanks,

  Read the article

• What's the benefit of calling new on an object instance?

  - by Geo

  I'm reading [Programming Perl][1], and I found this code snippet: sub new { my $invocant = shift; my $class = ref($invocant) || $invocant; my $self = { color => "bay", legs => 4, owner => undef, @_, # Override previous attributes }; return bless $self, $class; } With constructors like this one, what's the benefit of calling new on an object instance? I assume that it's what it's for, right? My guess is that if anyone would want to write such a constructor, he would have to add some more code that copies the attributes of the first object to the one about to be created.

  Read the article

• Example where Up-Front Design (Would have) Saved You Time

  - by Winston Ewert

  In various places I've seen the claim that by designing a system up-front, you can significantly reduce development time. I.e. by spending an hour designing you can save a week coding. My problem is that I have never seen a situation where I found this to be true. So I want to know of any examples out there that people have where this would be true: So: What sort of problem arose during coding? (or was avoided?) How could you have avoided (or did avoid) the problem by spending more time doing design? Why was it (or would it have been) hard to fix the problem in the code?

  Read the article

• What data structure would be the least painful DataTable replacement?

  - by MatthewMartin

  I'm storing a lot of sorted ~10 row 2 column/key value pairs in ASP.NET cache-- they're the data for dropdownlists. Right now they are all DataTables, which isn't very space efficient (the rule of thumb is 10x increase in size when data is strored in a dataset). Old Code DataTable table = dataAccess.GetDataTable(); dropDownList.DataSource = table; Hoped for new Code Unknown data = dataAccess.GetSomethingMoreSpaceEfficient(); dropDownList.DataSource = data; What pre-existing datastructures are similar enough to DataTable that would minimize code breakage and reduce the serialized size when stored in ASP.NET cache?

  Read the article

• Reducing unnecessary same values in Class member variables ....

  - by Freshblood

  class A { public int a; public int c; } i will create 10 instances from A.Then i will create 15 instances from A again... go on. first 10 instance will have same value for a variable and next 15 instances will have again same value for a.But I don't mean that both group has same values for a .Problem is create same a value 10 times in first group and 15 times in second group on memory unnecessary. What would be Best solution or solutions for reduce unnecessary datas in this situation?

  Read the article

• how to prevent myControl.g.cs from overwriting with wrong base class

  - by Jonny Cundall

  I've got two custom cursors for my app, MyCursor and MyOtherCursor, both of which were designed in xaml, and I added some behaviour in the xaml.cs for each of them. This behaviour was the same for both so I had them inherit from a base class to reduce code duplication. public partial class myCursor: CursorBase { public InterchangeCursor() { InitializeComponent(); } } public class CursorBase : UserControl { public virtual void MoveTo(Point pt) { this.SetValue(Canvas.LeftProperty, pt.X); this.SetValue(Canvas.TopProperty, pt.Y); } } my problem is that if I change something in the xaml for MyCursor, the MyCursor.g.cs file is regenerated, and instead of inheriting from CursorBase, the partial class in the g.cs inherits from System.Windows.Controls.UserControl. Since the other side of the partial class in the xaml.cs file still inherits CursorBase, a build error occurs. I'm finding it annoying fixing the g.cs file each time. Does anyone know how to prevent this happening?

  Read the article

• sql insert statement with a lot of same where clause and one different where cluase

  - by william

  I m sry if the title is not clear. Here's my proble. I created a new table which will show total, average and maximum values. I have to insert the results into that table. That table will have only 4 rows. No Appointment, Appointment Early, Appointment Late and Appointment Punctual. So.. I have sth like.. insert into newTable select 'No Appointment' as 'Col1', avg statement, total statement, max statement from orgTable where (general conditions) and (unique condition to check NO APPOINTMENT); I have to do that same thing for another 3 rows.. where only the unique condition is different to check early, punctual or late.. So..the statement is super long. I wanna reduce the size.. How can I achieve that?

  Read the article

• Python - Is there a better/efficient way to find a node in tree?

  - by Sej P

  I have a node data structure defined as below and was not sure the find_matching_node method is pythonic or efficient. I am not well versed with generators but think there might be better solution using them. Any ideas? class HierarchyNode(): def __init__(self, nodeId): self.nodeId = nodeId self.children = {} # opted for dictionary to help reduce lookup time def addOrGetChild(self, childNode): return self.children.setdefault(childNode.nodeId,childNode) def find_matching_node(self, node): ''' look for the node in the immediate children of the current node. if not found recursively look for it in the children nodes until gone through all nodes ''' matching_node = self.children.get(node.nodeId) if matching_node: return matching_node else: for child in self.children.itervalues(): matching_node = child.find_matching_node(node) if matching_node: return matching_node return None

  Read the article

• Parallelizing a serial algorithm

  - by user643813

  Hej folks, I am working on porting a Text mining/Natural language application from single-core to a Map-Reduce style system. One of the steps involves a while loop similar to this: Queue<Element>; while (!queue.empty()) { Element e = queue.next(); Set<Element> result = calculateResultSet(e); if (!result.empty()) { queue.addAll(result); } } Each iteration depends on the result of the one before (kind of). There is no way of determining the number of iterations this loop will have to perform. Is there a way of parallelizing a serial algorithm such as this one? I am trying to think of a feedback mechanism, that is able to provide its own input, but how would one go about parallelizing it? Thanks for any help/remarks

  Read the article

• How to quickly access documentation in Xcode 4.5.1?

  - by International Frog

  How can I quickly access the documentation for a symbol, method, enum, etc. in Xcode 4.5? alt + click on symbol shows a quick-info. Apple removed the dictionary icon which opened the documentation. I tried all other possible shortcuts of the cmd / alt / shift / click mumbo jumbo dance and none of them open the documentation browser. I suppose there is a hidden trick to quickly open it anyways? Edit: Figured out this new quick-info box has a link to the documentation.

  Read the article

• Why is the code adding 7 if the number is not >= 0

  - by Hugo Dozois

  I've got this program in MIPS assembly which comes from a C code that does the simple average of the eigth arguments of the function. average8: addu $4,$4,$5 addu $4,$4,$6 addu $4,$4,$7 lw $2,16($sp) #nop addu $4,$4,$2 lw $2,20($sp) #nop addu $4,$4,$2 lw $2,24($sp) #nop addu $4,$4,$2 lw $2,28($sp) #nop addu $2,$4,$2 bgez $2,$L2 addu $2,$2,7 $L2: sra $2,$2,3 j $31 When the number is positve, we directly divided by 8 (shift by 3 bits), but when the number is negative, we first addu 7 then do the division. My question is why do we add 7 to $2 when $2 is not >= 0 ? EDIT : Here is the C code : int average8(int x1, int x2, int x3, int x4, int x5, int x6, int x7, int x8) { return (x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8) / 8; } note : the possible loss in the division since we are using ints instead of floats or doubles is not important in this case.

  Read the article

• How taxing would a game map grid be to a web browser?

  - by Vilx-

  Suppose we're making a strategy game (think Civilization) in a web browser. The game has a visible map portion - say 30x30 squares. Each square is 30x30px and has several overlaid images - the terrain, resources, units, roads, etc. The classical way of drawing this would be with a huge <table> where each cell would contain absolutely positioned images. It would probably be rendered in Javascript to reduce traffic. But it's still several thousand images and a huge table. Can the browser take it? Will the performance not drop below any acceptable limits? Alternatively I could keep a pre-rendered map image with as many overlays as possible, but that would be more work, I think.

  Read the article

• Need a Javascript Expert, IE slow script

  - by Aaron Carlino

  I have a jQuery plugin running on my site that is executing very, very slowly in IE7/8 to the point that it throws a slow script warning to the user. It doesn't happen in any other browser, and I can't figure out what might be going on. If you go to this page: http://dev.xeetic.org/projects You'll see that there are 16 results on each page, and each one has a "flip" behavior attached, using the jQuery plugin "quickflip." Attaching this behavior is very slow in IE. If I reduce the result set to 8 or 4 per page, it's faster, but still very bogged down. I have contacted the author of the script with no success. I am willing to pay for a solution, if I'm allowed to offer such a thing on this site. Very desperate. Please help!

  Read the article

• Is it possible to make a script/plugin for Finder to toggle hidden files without relaunching?

  - by Andrei

  There are several ways how to toggle hidden files in Finder - via a shell command, or AppleScript, or Automator action, or even a Dashboard widget. All of them are doing the same thing and unfortunately require to close and reopen Finder windows, which is quite annoying. On the other hand, for the Open File dialog one can easily toggle hidden files by pressing Command+Shift+Period. Is it possible to make a script or plugin for Finder to toggle hidden files w/o relaunching? How would you make it?

  Read the article

• Approximate Number of CPU Cycles for Various Operations

  - by colordot

  I am trying to find a reference for approximately how many CPU cycles various operations require. I don't need exact numbers (as this is going to vary between CPUs) but I'd like something relatively credible that gives ballpark figures that I could cite in discussion with friends. As an example, we all know that floating point division takes more CPU cycles than say doing a bitshift. I'd guess that the difference is that the division is around 100 cycles, where as a shift is 1 but I'm looking for something to cite to back that up. Can anyone recommend such a resource?

  Read the article

• Why doesn't splicing an object from an array in Javascript return the array?

  - by Allen Gould

  I have an array of objects (say, a deck of cards): var deck = []; deck.push(new Card(suit, rank)); The following seems to work: var card = deck.pop(); var card = deck.shift(); (pulling from the "top" or "bottom" of the deck respectively) But if I want a card from the middle (say, if this was a hand of cards) var card = deck.splice(2,1); The object doesn't seem to get properly assigned to the variable (everything is undefined). Everything I look up says that splice should return the object that I'm removing - what am I missing?

  Read the article

• How do you mentally handle going from writing managed to non-managed code?

  - by Glenn Sandoval

  ~80% of the code I write is in C#. The other ~20% is in C++. Whenever I have to switch from C# to C++, it takes me quite a while to mentally "shift gears" to thinking in C++. I make simple mistakes using pointers and memory allocation that I would not have made when I was in university. Is this normal? Does anyone else experience something similar and if so, what do you do to cut down on the time this wastes?

  Read the article

• How can I print N array elements with delimiters per line?

  - by Mark B

  I have an array in Perl I want to print with space delimiters between each element, except every 10th element which should be newline delimited. There aren't any spaces in the elements if that matters. I've written a function to do it with for and a counter, but I wondered if there's a better/shorter/canonical Perl way, perhaps a special join syntax or similar. My function to illustrate: sub PrintArrayWithNewlines { my $counter = 0; my $newlineIndex = shift @_; foreach my $item (@_) { ++$counter; print "$item"; if($counter == $newlineIndex) { $counter = 0; print "\n"; } else { print " "; } } }

  Read the article

• All things equal what is the fastest way to output data to disk in C++?

  - by user260197

  I am running simulation code that is largely bound by CPU speed. I am not interested in pushing data in/out to a user interface, simply saving it to disk as it is computed. What would be the fastest solution that would reduce overhead? iostreams? printf? I have previously read that printf is faster. Will this depend on my code and is it impossible to get an answer without profiling? Edit: Output data needs to be in text format, whether tab or comma separated. This will require formatting, precision, etc. Running in Windows.

  Read the article

• How to optimize 'class name' in Android XML Layout ?

  - by Mac

  Hello, I am using some custom components in my project for that I am using following code. <view class="com.android.mypackage.myclass" id="@+id/button" android:layout_width="fill_parent" android:layout_height="fill_parent" android:background="@android:drawable/button" android:padding="10dip" /> Its working perfectly fine, I am using this code near about 35 times in my application. so while creating new clone application from same project, I need to update package name in 35 places. Is there any way to reduce these efforts? I had tried with "class="@string/class_name" but its not working.

  Read the article

< Previous Page | 108 109 110 111 112 113 114 115 116 117 118 119  | Next Page >