Search Results

Search found 7494 results on 300 pages for 'unused variables'.

Page 141/300 | < Previous Page | 137 138 139 140 141 142 143 144 145 146 147 148  | Next Page >

• optimized grid for rectangular items

  - by peterchen

  I have N rectangular items with an aspect ratio Aitem (X:Y). I have a rectangular display area with an aspect ratio Aview The items should be arranged in a table-like layout (i.e. r rows, c columns). what is the ideal grid rows x columns, so that individual items are largest? (rows * colums = N, of course - i.e. there may be "unused" grid places). A simple algorithm could iterate over rows = 1..N, calculate the required number of columns, and keep the row/column pair with the largest items. I wonder if there's a non-iterative algorithm, though (e.g. for Aitem = Aview = 1, rows / cols can be approximated by sqrt(N)).

  Read the article

• Is there a consolidated API reference for the Firefox browser.xul?

  - by cxw

  I have used Greasemonkey many times and am stepping up to Firefox extension development. Is there a consolidated reference for the variables, functions, and anything else that is available to overlays on browser.xul? Besides gBrowser, I note from the source that there are at least gNavToolbox, gURLBar, and gNavigatorBundle and would like more information about what services they provide. I have looked through the XUL School and XUL Tutorial on MDN, searched MozillaZine, and browsed the Jetpack documentation without finding anything but references to gBrowser. I have also looked at the code snippets referenced elsewhere (e.g.) and found specifics, but nothing that puts all the information together in one place. Is there such a reference?

  Read the article

• Anyone Know a Great Sparse One Dimensional Array Library in Python?

  - by TheJacobTaylor

  I am working on an algorithm in Python that uses arrays heavily. The arrays are typically sparse and are read from and written to constantly. I am currently using relatively large native arrays and the performance is good but the memory usage is high (as expected). I would like to be able to have the array implementation not waste space for values that are not used and allow an index offset other than zero. As an example, if my numbers start at 1,000,000 I would like to be able to index my array starting at 1,000,000 and not be required to waste memory with a million unused values. Array reads and writes needs to be fast. Expanding into new territory can be a small delay but reads and writes should be O(1) if possible. Does anybody know of a library that can do it? Thanks!

  Read the article

• LLVM Clang 5.0 explicit in copy-initialization error

  - by kevzettler

  I'm trying to compile an open source project on OSX that has only been tested on Linux. $: g++ -v Configured with: --prefix=/Applications/Xcode.app/Contents/Developer/usr --with-gxx-include-dir=/usr/include/c++/4.2.1 Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn) Target: x86_64-apple-da I'm trying to compile with the following command line options g++ -MMD -Wall -std=c++0x -stdlib=libc++ -Wno-sign-compare -Wno-unused-variable -ftemplate-depth=1024 -I /usr/local/Cellar/boost/1.55.0/include/boost/ -g -O3 -c level.cpp -o obj-opt/level.o I am seeing several errors that look like this: ./square.h:39:70: error: chosen constructor is explicit in copy-initialization int strength = 0, double flamability = 0, map<SquareType, int> constructions = {}, bool ticking = false); The project states the following are requirements for the Linux setup. How can I confirm I'm making that? gcc-4.8.2 git libboost 1.5+ with libboost-serialize libsfml-dev 2+ (Ubuntu ppa that contains libsfml 2: ) freeglut-dev libglew-dev

  Read the article

• How are vertex shader outs sent as inputs to the fragment shader?

  - by Jeffrey

  I'm learning some OpenGL 3.2 way of doing things and I think it's quite great, I'm actually understanding more of shaders and non-fixed pipeline in 1 week rather than those 2 years I tried to learn OpenGL fixed pipeline functions. But here's my question: From what I think I've understood the vertex shader is run for each vertexes in the VBO. But the fragments shader is run per each pixel (is that right?) which is a huge number compared to let's say 3 vertexes of a triangle. Now it seems that in the vertex shader the out variables (like colors and stuff) are passed 1 to 1 to the fragment shader. But let's say that I pass to the fragment shader the position of the vertex in the vertex shader. How is all executed? What vertex (A, B or C of the hipothetical triangle) is passed per each fragment and why?

  Read the article

• C# Keeping DLLs with the associated library

  - by SimonN

  We have a library built on the back of eldos' Secure Black Box. We use copy local to ensure that the appropriate runtime DLLs are included. If we now reference our library in another project with a copy local our library is copied into the bin folder of our main project but the Eldos SBB libraries aren't. We could reference SBB in the main project but there are no direct calls to SBB so any time the code is refactored the references may be removed as unused. What is the best way of handling this issue? Simon

  Read the article

• Custom constructors for models in Google App Engine (python)

  - by Nikhil Chelliah

  I'm getting back to programming for Google App Engine and I've found, in old, unused code, instances in which I wrote constructors for models. It seems like a good idea, but there's no mention of it online and I can't test to see if it works. Here's a contrived example, with no error-checking, etc.: class Dog(db.Model): name = db.StringProperty(required=True) breeds = db.StringListProperty() age = db.IntegerProperty(default=0) def __init__(self, name, breed_list, **kwargs): db.Model.__init__(**kwargs) self.name = name self.breeds = breed_list.split() rufus = Dog('Rufus', 'spaniel terrier labrador') rufus.put() The **kwargs are passed on to the Model constructor in case the model is constructed with a specified parent or key_name, or in case other properties (like age) are specified. This constructor differs from the default in that it requires that a name and breed_list be specified (although it can't ensure that they're strings), and it parses breed_list in a way that the default constructor could not. Is this a legitimate form of instantiation, or should I just use functions or static/class methods? And if it works, why aren't custom constructors used more often?

  Read the article

• Changing to PHP 5-5.5

  - by Xlaltra

  I've been using PHP-5.4.3 for about a month now, and today, I decided to make a switch to PHP-5.5.5, I downloaded the source code, and placed it in C:/php (also renaming the folder php-5.5.5 to php) and I added server variables, as usual C:/php/ <-- but here I got stuck. Because, usually I appended the php.exe at the end, which was found inside the PHP folder so, I could be able to access PHP from the command line, or start the built-in server, but now, I can't find this file, and I can't find a way to start the server from the command line either. Anyone help.

  Read the article

• Why do most of us use 'i' as a loop counter variable?

  - by kprobst

  Has anyone thought about why so many of us repeat this same pattern using the same variable names? for (int i = 0; i < foo; i++) { // ... } It seems most code I've ever looked at uses i, j, k and so on as iteration variables. I suppose I picked that up from somewhere, but I wonder why this is so prevalent in software development. Is it something we all picked up from C or something like that? Just an itch I've had for a while in the back of my head.

  Read the article

• iTune redeem codes: limited to a single version?

  - by Big Papoo

  Hi, I'm wondering if V1.0 generated redeem codes will be usable on a V1.1 version of my app? BTW, I know redeem codes are valid only 4 weeks and I also know that apps downloaded with a redeem code can be upgraded for free as with paid ones. My concern here is just: do unused redeem codes become invalid when a new version of my app will be available on the store? Apple's doc is not clear about this point. Did someone experience this yet ? Thx. --GQ.

  Read the article

• Is it good practice to initialize array in C/C++?

  - by sand

  I recently encountered a case where I need to compare two files (golden and expected) for verification of test results and even though the data written to both the files were same, the files does not match. On further investigation, I found that there is a structure which contains some integers and a char array of 64 bytes, and not all the bytes of char array were getting used in most of the cases and unused fields from the array contain random data and that was causing the mismatch. This brought me ask the question whether it is good practice to initialize the array in C/C++ as well, as it is done in Java?

  Read the article

• C# double &amp; nary for loops

  - by MarkPearl

  Something that I wasn’t aware was possible in C# was double for loops… they have the following format. for (int x = 0, y = 0; x < 10; x++, y=x*2) { Console.Write("{0} ", y); } Console.ReadLine(); This would give you the following output… 0 2 4 6 8 10 12 14 16 18 In fact you can use as many variables as you want, the following would also be valid… for (int x = 0, y = 0, z = 10; x < 10; x++, y=x*2) { Console.Write("{0} ", z); } Console.ReadLine();

  Read the article

• Is it possible to optimize maven dependencies automatically?

  - by AlexR

  I am working on a big project that consists of about 40 sub-projects with very not optimized dependencies. There are declared dependencies that are not in use as well as used but undeclared dependencies. The second case is possible when dependency is added via other dependency. I want to remove redundant and add required dependencies. I ran mvn dependency:analyze and got a long list of warnings I have to fix now. I wonder whether there is maven plugin or any other utility that can update my pom.xml files automatically. I tried to do it manually but it takes a lot of time. It seems it will take a couple of days of copy/paste to complete the task. In worse case I can write such script myself but probably ready stuff exists? Here is how mvn dependency:analyze reports dependency warnings: [WARNING] Used undeclared dependencies found: [WARNING] org.apache.httpcomponents:httpcore:jar:4.1:compile [WARNING] Unused declared dependencies found: [WARNING] commons-lang:commons-lang:jar:2.4:compile [WARNING] org.json:json:jar:20090211:compile

  Read the article

• Barrier implementation with mutex and condition variable

  - by kkp

  I would like to implement a barrier using mutex locks and conditional variables. Please let me know whether my implementation below is fine or not? static int counter = 0; static int Gen = 999; void* thread_run(void*) { pthread_mutex_lock(&lock); int g = Gen; if (++counter == nThreads) { counter = 0; Gen++; pthread_cond_broadcast(&cond_var); } else { while (Gen == g) pthread_cond_wait(&cond_var, &lock); } pthread_mutex_unlock(&lock); return NULL; }

  Read the article

• Why do you have to manually type variable names while debugging?

  - by SoboLAN

  I've seen this in a lot of IDEs (even in the most popular and heavily used ones, like Visual Studio): if you want to watch a variable's value, you have to manually type its name in the Watches section of the debugger. Why can't there just be a list of all of them with checkboxes next to them ? The developer can then just check the box next to the one he wants to watch and that's it. Variables with identical names can probably be numbered in some way (for example a, b, x(1), x(2), c, etc. I've seen some exceptions to this (NetBeans or BlueJ), but there are exceptions to everything, right ? Maybe it's a stupid question, maybe not, but I've always wondered why this is so.

  Read the article

• controlling the order of submitted futures

  - by mac

  In this example, i am submitting a few files to my comparator object. It all works fine, except that i noticed that order in which files are submitted is not always teh same order in which they are returned. Any suggestions on how i can better control this? ExecutorService pool = Executors.newFixedThreadPool(5); CompletionService<Properties> completion = new ExecutorCompletionService<Properties>(pool); for (String target : p.getTargetFiles()) { completion.submit(new PropertiesLoader(target, p)); } for (@SuppressWarnings("unused") String target : p.getTargetFiles()) { Properties r = null; try { r = completion.take().get(); } catch (InterruptedException e) { e.printStackTrace(); } catch (ExecutionException e) { e.printStackTrace(); } p.addTargetFilesProperties(r); } pool.shutdown();

  Read the article

• Why do we use to talk about addresses and memory of variable in C?

  - by user2720323

  Why do we use to talk about addresses and memory of variable in C, where in other languages (like in Java, .Net etc) we do not talk about variable address and memory in a program, we will directly use the variables. But in C Language we are listening the word address and memory. How to explain this? I hope C is high level language designed over the assembly language. So C is a thin layer over assembly language (in assembly language we will use memory locations to store a variable and track a variable). But in other languages these addresses and memory related things are wrapped in that specific language, so that we will not listen these words.

  Read the article

• How to create and maintain patch on Debian package?

  - by ???

  I want to patch on Trac package. I know how to patch and rebuild the package, but there are some things I don't understand very well. My patch is something dangerous and not likely to commit back to the community. So, let me just say, it's a very private patch. But, I want my patch keep working when the Ubuntu packages upgrade. (Should I apt-get source trac and move my patch to the new version of source directory each time the Trac upgrades?) I see there is a patch/ directory (many using quilt I guess) in debian/, but I don't know how to use it? Will debuild automatic apply all patches in the patch/ directory? And what about dpkg-buildpackage? Is there some environ variables to control the selection of patches to apply?

  Read the article

• reinstalling totem 3.0.1 from source

  - by user1537727

  I have totem 3.0.1 installed on my system, but I wish to install from source the same and when I do so i am presented with the following dependency errors. How can this be possible? configure: error: Package requirements ( glib-2.0 >= 2.27.92 gio-2.0 >= 2.27.92 gtk+-3.0 >= 2.99.3 gdk-x11-3.0 >= 2.99.3 gmodule-2.0 totem-plparser >= 2.32.4 gstreamer-tag-0.10 >= 0.10.26 cairo) were not met: No package 'totem-plparser' found Consider adjusting the PKG_CONFIG_PATH environment variable if you installed software in a non-standard prefix. Alternatively, you may set the environment variables DEPENDENCY_CFLAGS and DEPENDENCY_LIBS to avoid the need to call pkg-config. See the pkg-config man page for more details.

  Read the article

• What is the possible disadvantage of putting declarations in inner blocks, instead of at beginning of function?

  - by shan23

  At the place where I work, there are explicit guidelines for placement of declarations of variables. According to that, it is required to put them at the global level and / or at the beginning of functions, and not in inner blocks (such as a for loop). Since they've been specified by persons more experienced than I am, I'm sure that there must be a good reason for it, but I cannot figure out what that might be. It would be nice to know if there are any compile time / run time advantages at having them declared at a bigger scope.

  Read the article

• Are there any reliable solutions for annotations/reflection/code-metadata in C?

  - by dukeofgaming

  Not all languages support java-like annotations or C#-like attributes or code metadata in general, however that doesn't mean it is not possible to have in languages that don't have this. An example is PHP with Stubbles and the Doctrine annotation library. My question is, is there anything like this for C?, or are there any reliable ways of doing reflection with extended code metadata in C? Ideally, I'm looking for something that reads javadoc-like comments. Edit: The reason for me *needing* as opposed to just wanting, is that I need to generate C code and code-metadata from a database, as well as being able to edit that metadada and update the database. The volume of the work (~15,000 variables/structures/functions to generate from this database) justifies the solution.

  Read the article

• Where's the rest of the space used in this table?

  - by Eric H.

  I'm using SQL Server 2005. I have a table whose row size should be 124 bytes. It's all ints or floats, no NULL columns (so everything is fixed width). There is only one index, clustered. The fill factor is 0. After inserting a ton of data, sp_spaceused returns the following name rows reserved data index_size unused OHLC_Bar_Trl 117076054 29807664 KB 29711624 KB 92344 KB 3696 KB which shows a rowsize of approx (29807664*1024)/117076054 = 260 bytes/row. Where's the rest of the space? Is there some DBCC command I need to run to tighten up this table (I could not insert the rows in correct index order, so maybe it's just internal fragmentation)?

  Read the article

• Missing something with Reader monad - passing the damn thing around everywhere

  - by Richard Huxton

  Learning Haskell, managing syntax, have a rough grasp of what monads etc are about but I'm clearly missing something. In main I can read my config file, and supply it as runReader (somefunc) myEnv just fine. But somefunc doesn't need access to the myEnv the reader supplies, nor do the next couple in the chain. The function that needs something from myEnv is a tiny leaf function. So - how do I get access to the environment in a function without tagging all the intervening functions as (Reader Env)? That can't be right because otherwise you'd just pass myEnv around in the first place. And passing unused parameters through multiple levels of functions is just ugly (isn't it?). There are plenty of examples I can find on the net but they all seem to have only one level between runReader and accessing the environment.

  Read the article

• Makefile automatic link dependency ?

  - by Kuang Chen

  It's easy to let program figure out the dependency at compile time, (with gcc -MM). Nevertheless, link dependency (deciding which libraries should be linked to) seems to be difficult to figure out. This issue become emergent when multiple targets with individual libraries to link to are needed. For instance, three dynamic library targets t1.so, t2.so and t3.so needs to be built. t1.so needs math library (-lm), while t2 and t3 don't. It would be tedious to write separate rules. A single rule requiring the three targets linked with math library saves the trouble. However, it causes inflation of target size since math library is unused for t2.so and t3.so. Any ideas?

  Read the article

• Cannot boot Windows 7 after installing Ubuntu 13.04

  - by whowantsakookie

  So I boot up my computer after installing Ubuntu 13.04. Grub correctly shows me all available boot options and I am able to boot to Ubuntu. However, when I try to boot into Windows 7, grub hangs at a purple screen. I have an HP laptop. It came with all four primary partitions taken up by the Windows bootloader, the actual Windows partition, one called HP_TOOLS, and another for HP Restore. I was able to back up and delete HP_TOOLS and the recovery partition, and change my disk type from Dynamic to Basic (GParted doesn't recognize Dynamic drives). I then booted into a live session of Ubuntu and made two partitions with GParted: one large partition for storage space that I could use between the two operating systems (sda4), and another extended partition (sda3) which contained Ubuntu (sda6) and it's swap space (sda5). It currently looks like this: I'm not sure if the second paragraph is actually relevant, I just want you to know all the variables in the equation. Thank you in advance for helping this poor noob.

  Read the article

< Previous Page | 137 138 139 140 141 142 143 144 145 146 147 148  | Next Page >