Search Results

Search found 3458 results on 139 pages for 'concurrent queue'.

Page 78/139 | < Previous Page | 74 75 76 77 78 79 80 81 82 83 84 85  | Next Page >

• glassfish v3 asadmin how to specify XA on connection factory

  - by NDK

  This worked in GFV2: $AS_HOME/bin/asadmin \ --host $AS_ADMIN_HOST \ --user $AS_ADMIN_USER \ --port $AS_ADMIN_PORT \ create-jms-resource \ --restype javax.jms.QueueConnectionFactory \ --description XA\ Queue\ Connection\ Factory \ --property Name=myXAQueueConnectionFactory:SupportsXA=true \ jms/myXAQueueConnectionFactory But the SupportsXA=true no longer works. Maybe I can't find it in the GFV3 manuals, nor can I find it via our friend Google: how to specify XA transactionality using asadmin to configure the factory? Anybody out there know how?

  Read the article

• How to call recording Callback in custom CFRunLoop in iPhone

  - by S.P.

  I am recording audio in iPhone .. This is my Audio Queue object AudioQueueNewInput( &audioDescription, recordingCallback, self, CFRunLoopGetCurrent(), kCFRunLoopDefaultMode, 0, &mInputQueue ); But i want to run this in a seperate RunLoop..How to create custom CFRunLoop ? Please help me..Thanks in advance.

  Read the article

• how to identify process in kernel read func without using current->pid

  - by yoavstr

  my lecture wants us to build module where we need to identify each read process and where the same read process called twice on the same writer massage we should insert him to an queue who's we wake up when all readers have read I achieved this goal by by using list of pid's and boolean read/not_read inside each node but he decided to be nasty and require us to it with some argument from FILE struct can you please help me ?....

  Read the article

• Reversed Sorted Dictionary?

  - by Mark

  I have a SortedDictionary as defined like this: SortedDictionary<TPriority, Queue<TValue>> dict; But I want to sort the keys in reverse order. I assume I need set the Comparer, but what comparer do I use for a generic TPriority? Note that TPriority implements IComparable.

  Read the article

• BlockingQueue decorator that logs removed objects

  - by scompt.com

  I have a BlockingQueue that's being used in a producer-consumer situation. I would like to decorate this queue so that every object that's taken from it is logged. I know what the straightforward implementation would look like: simply implement BlockingQueue and accept a BlockingQueue in the constructor to which all of the methods would delegate. Is there another way that I'm missing? A library perhaps? Something with a callback interface?

  Read the article

• Example of Singleton pattern

  - by Supereme

  Hi, Can anybody tell me a good example of Singleton pattern? Also I've one doubt to ask, Is the following scenario is that of singleton pattern: When we have many printers connected in LAN but only one printer queue?

  Read the article

• How do I use mqueue in a c program on a Linux based system?

  - by Johan

  Hi How do I use mqueue (message queue) in a c program on a Linux based system? I'm looking for some good code examples that can show how this is done in a correct and proper way, maybe a howto. Thanks

  Read the article

• What is the best data-structure for storing elements which will be retrieved only once and then dele

  - by Jay

  I want to design a data-structure for storing elements, which will be retrieved only once after insertion and will be deleted after that. I can't use a stack or queue as the order of retrieval is not guaranteed. [EDIT] - I would like to use contigous memory (I would prefer to avoid doing malloc every now and then) and also I would prefer searchability also.

  Read the article

• How can I wrap an executable on UNIX (SunOS) so that it is never run more than once at the same time

  - by user332815

  I have an executable (no source) that I need to wrap, to make sure that it is not called more than once at a time. I immediately think of some sort of queue wrapper, but how do I actually make it so that my wrapper is called instead of the executable itself? Is there a better way to do this? The solution needs to be invisible because the users are other applications. Any information/recommendations are appreciated.

  Read the article

• Check directory for files, retrieve first file

  - by Lowgain

  I'm writing a small ruby daemon that I am hoping will do the following: Check if a specific directory has files (in this case, .yml files) If so, take the first file (numerically sorted preferrably), and parse into a hash Do a 'yield', with this hash as the argument What I have right now is like: loop do get_next_in_queue { |s| THINGS } end def get_next_in_queue queue_dir = Dir[File.dirname(__FILE__)+'/../queue'] info = YAML::load_file(queue_dir[0]) #not sure if this works or not yield info end I'd like to make the yield conditional if possible, so it only happens if a file is actually found. Thanks!

  Read the article

• How to handle asynchronous socket receiving in C++?

  - by Overv

  I'm currently using a thread to handle Connect and Send calls asynchronously. This is all working fine, but now I want to make receiving asynchronous too. How should I receive data without pausing the whole queue while waiting for data? The only solution I can think of right now is a second thread.

  Read the article

• ipod app replacement-in-a-tab?

  - by Frank C

  With the new media-library capabilities in the 3.0 SDK, I'd like to have a tab in my application to control the music that's playing. Not just pause and play (i'm aware that pressing the home button twice brings up controls for this), but also the ability to browse and queue albums/artists/songs/playlists. Basically a copy of the ipod app functionality. Any chance someone has already done this and made it freely available?

  Read the article

• Data Structures using C or C++?

  - by user362439

  What are the advantages of using C++ based Classes/Objects over using legacy C Structures for managing standard Data Structures like Linked List, Stack, Tree, Queue ..etc? Let me know if the question is not clear.

  Read the article

• C++ Win/Linux thread syncronization Event

  - by JP

  Hello I have some code that is cross-platform by unsing #ifdef OS, I have a Queue protected by a CriticalSection on Windows, and by a pthread_mutex_t on Linux. I would like to implement a Wait(timeout) call that would block a thread until something has been enqueued. I though about using WaitForSingleObject on windows but it don't seem to support CriticalSection. Which Win32 and which Linux functions should I use to Wait and Signal for a condition to happen. Thank

  Read the article

• Best way to send floating point numbers from .NET to Java and back

  - by Evgeny

  I'm writing a .NET application that will make an RPC call to a Java application (via a message queue). The data sent in both directions will be large arrays of floating-point numbers. What is the best way to serialize them to send them across the wire? I'd like something more compact than text, but architecture-independent as the server may not be an x86 machine. The Java application can be changed as needed.

  Read the article

• A simple scenario using wait() and notify() in java

  - by Olaseni

  Can I get a complete simple scenario i.e. tutorial that suggest how this should be used, specifically with a Queue?

  Read the article

• Is it possible to figure out (approximately) what line of source code a kernel module is hung on, fr

  - by Mike Heinz

  I'm trying to debug what appears to be a completion queue issue: Apr 14 18:39:15 ST2035 kernel: Call Trace: Apr 14 18:39:15 ST2035 kernel: [<ffffffff8049b295>] schedule_timeout+0x1e/0xad Apr 14 18:39:15 ST2035 kernel: [<ffffffff8049a81c>] wait_for_common+0xd5/0x13c Apr 14 18:39:15 ST2035 kernel: [<ffffffffa01ca32b>] ib_unregister_mad_agent+0x376/0x4c9 [ib_mad] Apr 14 18:39:16 ST2035 kernel: [<ffffffffa03058f4>] ib_umad_close+0xbd/0xfd Is it possible to turn those hex numbers into something close to line numbers?

  Read the article

• very confused please answer [closed]

  - by davit-datuashvili

  hi i am very surpise when somebody post question everybody are saying it is homework please show us your effort now i have done this code http://stackoverflow.com/questions/2902781/priority-queue-implementation question is is this implementation correct? and nobody tell me answer also this one http://stackoverflow.com/questions/2896811/question-about-siftdown-operation-on-heap-closed can anybody explain me what is happened?no one answer me why?

  Read the article

• How to control wether or not my app will stop any iPod music playing?

  - by mystify

  When my app launches, there are rumors that I can decide if any currently playing music is stopped or not. My goal is to use Audio Queue Services, because I believe that's the most powerful audio technology in iPhone OS. So, could I really decide that when my app launches? How? Which one of the many audio technologies on the iPhone OS is responsible for managing this?

  Read the article

• writing 'bits' to c++ file streams

  - by Sorush Rabiee

  How can i write 'one bit' into a file stream or file structure each time? is it possible to write to a queue and then flush it ? is it possible with c# or java? this was needed when i try to implement an instance of Huffman codding. i can't write bits into files. so write them to a bitset and then (when compression was completed) write 8-bit piece of it each time (exclude last one).

  Read the article

• C++ Any way to store different templated object into the same container

  - by JP

  Is there any hack I could use to do this: template <class TYPE> class Hello { TYPE _var; }; I would like a way to store Hello<int> intHello and Hello<char*> charHello into the same Container such as a Queue / List.

  Read the article

• C# lines of Code

  - by matt

  What does this do exactly? var counts = new Dictionary<string, int>(); for (int i = 0; i < 10; i++) counts[string.Format("STA Thread Queue Worker Thread No. {0}", i + 1)] = 0; Thanks

  Read the article

• Best Java thread-safe locking mechanism for collections?

  - by Simon

  What would be the least-slow thread-safe mechanism for controlling multiple accesses to a collection in Java? I am adding objects to the top of a collection and i am very unsure what would be the best performing collection. Would it be a vector or a queue? I originally thought an ArrayList would be fast but i ran some experiments and it was very slow. EDIT: In my insertion testing a Vector delared using volatile seems to be the fastest?

  Read the article

• WinSock best accept() practices

  - by Meta

  Imagine you have a server which can handle only one client at a time. The server uses WSAAsyncSelect to be notified of new connections. In this case, what is the best way of handling FD_ACCEPT messages: A Accept the connection attempt right away but queue the client until its turn? B Do not accept the next connection attempt until we are done serving the currently connected client? What do you guys think is the most efficient?

  Read the article

• XML Document straight to Stored Proc Mapping in NHibernate

  - by ZekeTheGeek

  Hello. I'm building a mechanism to take XML data from a queue and call stored procs to save the data from the XML document directly to the database. This seems like something that NHibernate could address, but of course most of the information I find discusses going from objects to database instead of another data format (XML, in this case). Is there a way to use NHibernate in this fashion or am I barking up the wrong tree? Thanks.

  Read the article

< Previous Page | 74 75 76 77 78 79 80 81 82 83 84 85  | Next Page >