similar to: Asterisk Queue Dialplan

Hi guys, Having a little problem.How can I know where queue is my agent login from my CDR table? Sorry my English's terrible. Best regards, Daniel Stefanus

what package should I include to use timeDate? I want to convert a double (num of millis) into date object.

Hi, If I have the following data.frame >y time val 1 08:00:05.834 1 2 08:03:13.345 2 3 08:10:12.443 3 > and the following function which converts the time string to the number of milliseconds since midnight > str_to_millis function( s ) { a <- as.numeric( unlist( strsplit(s,":",fixed="TRUE") ) ) m <- a[1]*3600000 + a[2]*60000 + a[3]*1000 }

I have a problem where if an agent's extension is busy and has voicemail the queue app will follow the dialplan and send the caller to an agents voicemail. This is really bad, because it takes the caller out of the queue when it hits that agent. But we also would like to have voicemail for some extensions like the shift managers etc. Is there s solution/workaround/patch? Thanks, -Ryan

Hi Stefanus, Thanks for verifying this. Could you patch this or should I open a new bug report and find a generic solution first? Cheers, Nicolas From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Stefanus Du Toit Sent: woensdag 1 april 2009 18:59 To: LLVM Developers Mailing List Subject: Re: [LLVMdev] Shuffle combine On 1-Apr-09, at 12:42

Hi Stefanus, Thanks for the info. I still think it's a bug though. Take for example a case where the vectors each have four elements. The values in Mask[] can range from 0 to 7, while HLSMask only has 4 elements. So LHSMask[Mask[i]] can go out of bounds, no? Cheers, Nicolas From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Stefanus Du

Hi Nicolas, On 2-Apr-09, at 6:04 PM, Nicolas Capens wrote: > Thanks for verifying this. Could you patch this or should I open a > new bug report and find a generic solution first? I don't have write access so the best I could do would be to submit a patch, and I'm crazy busy at the moment. I actually think the check I described below is fine and would fix this bug (but

On 1-Apr-09, at 12:42 PM, Nicolas Capens wrote: > Hi Stefanus, > > Thanks for the info. I still think it’s a bug though. Take for > example a case where the vectors each have four elements. The values > in Mask[] can range from 0 to 7, while HLSMask only has 4 elements. > So LHSMask[Mask[i]] can go out of bounds, no? Good point! One easy way to fix this would be to use:

The llvm-dev archives (and other llvm/clang mailing list archives) on the web don't seem to have any new messages since some time Monday night. Stefanus -- Stefanus Du Toit <stefanus.dutoit at rapidmind.com> RapidMind Inc. phone: +1 519 885 5455 x116 -- fax: +1 519 885 1463

Hi, We currently testing a trixbox/asterisk installation and have used Freepbx to set-up and configure the box and it is running tremendously well. We have an generic IVR configured to which can transfer callers to a child IVR. This child IVR has a number of options to send the caller off to various queues. However we would like to protect some of the options with a password/pin number so that

Before I go off and post a feature request on the bug tracker, I want to make sure I've not misgoogled or miswikkid and not found an existing capability. What I'm looking for is the ability to determine whether or not a queue has any queue handlers (active agents), and if it does not, bypass sending the caller to the queue and pass them on to a message or IVR system. Is there a

Thank you Kevin, I've looked at your solution and while I agree it's not ideal it does appear to be something that might work for me. I'll see if I can maybe backport the QUEUE_MEMBER stuff to 1.8 from 11. I'm also exploring an idea with a co-worker of using an AMI listener that will fire off actions in response to the member being paused and doing things that way. I looked at

For those curious about uses of LLVM, we just officially announced our adoption of LLVM in our products: http://www.rapidmind.com/News-Nov10-08-LLVM-OpenCL.php Thanks for all the support so far on here, we look forward to continuing to work with LLVM! -- Stefanus Du Toit <stefanus.dutoit at rapidmind.com> RapidMind Inc. phone: +1 519 885 5455 x116 -- fax: +1 519 885 1463

asterisk-users-bounces at lists.digium.com wrote on 03/25/2015 01:38:26 PM: > I'm looking at enabling autopause on one of my queues where my queue > members are bad about leaving their desks without pausing. > The problem I see is that when the queue pauses an Member it doesn't > jump into the dialplan to do so which means my handy device state > and asterisk database

Hi all, I've located a regression that causes my project to crash. It's in revision 67979, where PointerIntPair is changed from storing the integer in the upper bits instead of the lower bits. My project is an experimental JIT-compiler in Windows. So I was wondering if anyone had any clue why the new PointerIntPair implementation might fail. It doesn't seem very safe to me to

On Tue, Oct 11, 2016 at 8:59 PM Mehdi Amini <mehdi.amini at apple.com> wrote: > > 5. *Not flexible.* How do you print a std::chrono::time_point with > llvm::format()? You can't. You have to resort to providing an overloaded > streaming operator or formatting it some other way. > > > It seems to me that there is no silver bullet for that: being for >

On May 1, 2009, at 3:40 PM, Stefanus Du Toit wrote: > Hi Nicolas, > > Looks like Preston and I have found the cause of the problem. The > issue is with PointerLikeTypeTraits<T*>::NumLowBitsAvailable. This > is set to 3, which basically assumes that unless the traits are > specialized for a particular pointer type, objects of that type are > allocated with

Hello, We've run across the following missed optimization: in the attached loop (addind.c/addind-opt.ll) there's a lookup into an array (V) using an indirect index (coming from another array, WI[k]) offset by a loop- invariant base (l). The full addressing expression can be reassociated so that we add the offset l to V's base first, and then add the indirect part. This makes

Hi all, I'm having some trouble understanding the following lines in InstructionCombining.cpp, which possibly contain a bug: if (Mask[i] >= 2*e) NewMask.push_back(2*e); else NewMask.push_back(LHSMask[Mask[i]]); When Mask[i] is bigger than the size of LHSMask it reads out of bounds on that last line. I believe the first line is there to try to prevent that but then it

On 31-Jul-08, at 2:38 PM, Dan Gohman wrote: > On Jul 31, 2008, at 7:22 AM, Nicolas Capens wrote: >> In the same breath I’d also like to kindly ask if someone could have >> a look at the reverse operations, namely trunk from 128 to 64 bit >> using movdq2q, and 128 to 32 and 64 to 32 using movd. This also >> seems related to Bug 2585. Thanks again. > > The operations