Replacement for the comma key?

I'm currently using a Microsoft USB keyboard connected to my Macbook when at my desk that had a whole glass of water spilled on it. I dried it all out, and it is all working aside from the comma key.
Is there any way that I can bind another key to work as the comma key? (for example the "~" key which I never use)

Is there any way that I can bind another key to work as the comma key? (for example the "~" key which I never use)
It's easy to make a custom keyboard layout with the comma key moved somewhere else using Ukelele:
http://scripts.sil.org/cms/scripts/page.php?siteid=nrsi&itemid=ukelele

Similar Messages

Remaping the comma-key to be a dot-key (Apple Keyboard)

Hi there,
I am working on an Apple Keyboard and need to remap the comma-key to be a dot-key. Do you know how to do it?
Thank you.

Thanks all of you for reply. I have attached an image clearing up everything.
My Apple Keyboard is in Spanish. It means the comma-key which is found in the numeric keyboard is being used for separating groups of three digits (e.g. two millions: 2,000,000) rather than for the decimmal point, as should be according to my configuration for numbers.
My configuration for numbers is:
My keyboard is:
Thank you.

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Replacement for the Replacement? help!! 1st generation program

Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
Thanks in advance...

Apple Service Operations
3011 Laguna Blvd., Building A
ELk Grove, CA 95758

EHSM - Create Vendor - error: 'Could not find a document for the given key'

Dear all,
In the Chemical Approval Process I have attached a SDS document to the Approval Request. You can assign a Vendor to the SDS. As there are no (EHSM) Vendors currently available in the system I would like to create a new (EHSM) Vendor by clicking on 'Create Vendor'.
This will lead me to the following Webdynpro Application: Edit Vendor (EHFND_UI_VENDOR_OVP).
Only one field is shown in the Webdynpro named: 'Name of the Vendor'. After typing a name e.g. 'test', the following error message appears; 'Could not find a document for the given key'. See also attached document. This issue looks like a missing number range, however I could not find a EHSM number range for Vendors.
How to solve this issue?
More information:
Software Component: SAP EHS Management (EHSM) Support Package: 3
Process: Chemical Approval
Webdynpro application: EHFND_UI_VENDOR_OVP
Thank you.
Kind regards,
Roy

Hi
babooraj
This might be a problem with Windows Power Shell.
The solution is to copy the folder: "PSWorkflow" from "C:\Windows\System32\WindowsPowerShell\v1.0\Modules\"
to "C:\Windows\SysWOW64\WindowsPowerShell\v1.0\Modules"
Than everything works fine.
Ps.: @Microsoft, please fix this problem in future versions.
Thomas van Veen

How to search in BI 7.1 query designer for the required key figures & chars

Hi All,
Can anyone plz tell me how to search in BI 7.1 query designer for the required key figures & characteristics. I have the query being built on a multiprovider which has many cubes.
So, i have a huge list of key figures and characteristics. I am not able to search for the required one by the name or the technical name.
How can we search and pick the required object from the enormous list of the Mutliprovider in the Bex Query Designer??
Thanks
Phani

There is not a search feature available. You have to do an educated guess under what dimension your infoobject could be and select.

LR5 KEEPS asking me for the license key

I have installed Lightroom 5 on my Mac (OS X 10.9.5). I have installed both via disk and via download. It says installation is complete. When I go to open LR5 it asks me for the license key and says that license key is good. Problem is that it asks me for the license key EVERY time I open LR5 and after I enter it and hit finish it closes LR5. I cannot get past this. I have un-installed, restarted my computer and re-installed about a dozen times with the same result. Any ideas?

reset your preferences -
acrobat: http://help.adobe.com/en_US/acrobat/X/pro/using/WS58a04a822e3e50102bd615109794195ff-7feb.w .html
adobe media encoder: https://forums.adobe.com/thread/1713540
after effects: http://helpx.adobe.com/after-effects/using/preferences.html
dreamweaver: https://helpx.adobe.com/dreamweaver/kb/restore-preferences-dreamweaver-cs6-cc.html
flash: http://helpx.adobe.com/flash/kb/re-create-preferences-flash-professional.html
illustrator: http://helpx.adobe.com/illustrator/using/setting-preferences.html
indesign: https://forums.adobe.com/thread/526990
lightroom: https://helpx.adobe.com/lightroom/help/setting-preferences-lightroom.html
muse (mac): https://forums.adobe.com/thread/1246022?tstart=0
photoshop: https://forums.adobe.com/thread/375776
photoshop elements: http://www.photokaboom.com/photography/learn/Photoshop_Elements/troubleshooting/1_delete_p references_file.htm
premiere pro: http://www.mediacollege.com/adobe/premiere/pro/troubleshooter/trash-preferences.html
if that fails, uninstall, clean (http://www.adobe.com/support/contact/cscleanertool.html) and reinstall
or see if this works for you, Lightroom: Asking for serial number each time it's launched

Is there a fix for the noisy keys on a HP Pavilion dv7 6163 US? Especially around the "a" key

Is there a fix for the noisy keys on a HP Pavilion dv7 6163 US? Especially around the "a" key

I have the same problem, and this did NOT fix the issue!
Edit: I would give you negative kudos if I could. I have seen hp reps post this as a solution way too many times. THIS DEFINITIVELY DOES NOT FIX THE ISSUE!

Is there a replacement for the canon 7d

Is there a replacement for the canon 7d

See this thread
http://forums.usa.canon.com/t5/EOS/Is-there-going-to-be-another-canon-7d-with-ten-frames-a-second/m-...

Exactly what IPod's are being received as replacement for the recalled 1st generation

Exactly what IPod's are being received as replacements for the recalled 1st generation one's

6th Generation Silver Nano 8GB

Message no.8Z876 No time base defined for the revaluation key -Problem ABAW

Hello,
I have a problem... I have a revaluation area (04: in local currency) and a parallel revaluation area (05: in hard currency) and I have to revaluate an asset, but I couldn't with Tx ABAW. The error is :
Message no. 8Z876 No time base defined for the revaluation key
I checked the configuration and I think it's all ok. I did some tests and I could revaluate only the Area 04 (local currency). Example:
Area 04: 500000 PEN
Area 05: 0 USD.
But this is a big problem for example when I make a transfer the asset to other because the revaluation Area doesn't transfer.
Can anybody please tell me how resolve this?
Regards,
Fernando
PD: I'm so sorry for my grammatical errors, I'm spanish speaker

Hi
The error
message 8Z 876 can be shown for two basic things:
1. TBE (Time Base exposure variant) is not maintained.
   Please check if any time base is maintained for the revaluation key.
And if it have all the intervals correctly defined and the post flag
marked for the months required to calculate revalaution.
   If it is maintained please check if the last revaluation date is
filled in your revaluation areas. If the last revaluation date field is
blank, the time base must have the following entry: 31.12.XXXX-1 where
XXXX is the current fiscal year (for ABAW).
2. In the ABAW transaction itself you are trying to post values to any
of the parallel areas defined in the chart of depreciation.
   In transaction ABAW (or AB01) do not post any amount to parallel
areas. The posted values should be equal to zero.
   The values in hard currency will never be revaluated by the inflation
program. If this is the case, please enter manually only zero values as
"Amount posted" in those parallel areas.
If by some specific reasons you still plan to post (manually) to these
parallel areas, you will get error message 8z876 in accordance to your
explanation of the problem.
   To allow posting of non-zero amounts to these areas, you need to
create Revaluation Key NULO. To do this, go to the customizing system
IMG (transaction SPRO) according to the link:
IMG -> Financial Accounting -> Asset Accounting -> Special Valuation ->
        Revaluation of Fixed Assets -> Revaluation for the Balance Sheet
        -> Inflation -> Maintain Revaluation Keys
Create new entry (click F5) for key with name NULO, And save data
(Ctrl+S).
Please, adjust your customizing in accordance with the instructions
above.
Best Regards,
Blaz

Exception: non-read-only mapping defined for the primary key field

Hello.
I'm new to Oracle and I created Java EE Web Project.
And I created entities from tableA, tableB, tableC from my database.
tableA has foreign key to tableB and has unidirectional Many-to-One relationship. tableC has two primary keys and one of these is foreign key to primary key in tableA. tableC also has unidirection Many-to-One relationship to tableA.
Then I created session bean and data control from it, in design window, created read-only table from tableA.
And I selected columns in tableA and also in tableB.
I ran the application and saw the following exception in log window.
Local Exception Stack:
Exception [EclipseLink-46] (Eclipse Persistence Services - 2.1.3.v20110304-r9073): org.eclipse.persistence.exceptions.DescriptorException
Exception Description: There should be one non-read-only mapping defined for the primary key field [tableC.tableA_ID].
Descriptor: RelationalDescriptor(mypack.tableC --> [DatabaseTable(tableC)])
tableA_ID is a primary key in tableA.
How can I solve this error?
Please help me.
Edited by: 900471 on 2011. 12. 3 오전 5:32
Edited by: 900471 on 2011. 12. 3 오전 5:33
Edited by: 900471 on 2011. 12. 3 오전 5:33
Edited by: 900471 on 2011. 12. 3 오전 5:34

There are not enough details to be sure since you have not provided the mappings. From just the error, it looks like you are using the tableC.tableA_ID field as the foreign key in the ManyToOne relationship to A, but have marked it as insertable=false, writeable=false, meaning that it cannot be updated or used for inserts.
Either make it writable (set the settings to true), or add another basic mapping/attribute in the entity for TableC that maps to the field which you can use to set when you insert a new tableC entity. A simple example is available at
http://wiki.eclipse.org/EclipseLink/Examples/JPA/2.0/DerivedIdentifiers
Best Regards,
Chris

Data not adding for the same Key up in Infocube

Hi,
My Dataflow goes like this: Datasource -> DSO -> Infocube.
I have created 2 DSO's for Deliveries Header & Delivery Item Seperately which gets data from 2LIS_11_VCHDR & 2LIS_11_VCITM Datasources. Both DSO's have Delivery Number & Fiscal Year variant as Key. 20 records are getting loaded to each DSO's seperately. Both the DSO's have the same Delivery Numbers & Fiscal year Variant for this 21 Records in their respective Loads as given below:
                                 DSO 1                                                                  DSO 2
S.No.       Deliver No.    Fiscal Year Var.                          Delivery No.       Fiscal Year Var.
   1               12345                     V3                                          12345                         V3
   2               28456                      V3                                          28456                        V3
   3               34986                      V3                                          34986                        V3
Now, I am loading data from this 2 DSO's to one Infocube, Deliveries Infocube. The problem is, after the Data load, when i go to the Contents of the Infocube, I could see 42 records. As per Infocube, it should add up the values for the same key. My Delivery numbers & Fiscal year vairant are the same in both the DSO's, so i should have got only 21 records. Why is the Infocube not adding up the records in this case, am i missing anything here?
Thanks & Regards,
Murali

Hi Murali,
As you are loading data from two different sources, there are two different requests and that is why you are getting 42 records, if you want to check the data consistency then create a query on top of this infocube and then check the values of key figures for delivery no's. or verify your data through query.
If you don't want to create query then you can use aggregation option from the display data of Infocube.
If you compress both the requests then you will see only 21 records in infocube.
Regards,
Durgesh.

Replacement for the J6400

We currently have a HP OfficeJet J6400 All-in-One Printer. It works fine and we are happy with it. However, our platforms are changing. We both have iPhones, iPads and iPods. We need to migrate to an Air Printer in order to make better use of our technology. It's a pain to have to send something to another platform (laptop) and then print.
My question is, which HP with Air Print would be a good replacement for the J6400. We still want all the features of an All-in-One.
Thanks,
Jim
This question was solved.
View Solution.

Hello jghannah
For a list of AirPrint printers check the right hand side of this page.
I personally think either the Officejet 6500A Plus or the Officejet Pro 8600 would be perfect for your upgrade. They share a similar design to that of the Officejet 6400 series. They all have Airprint as well. For a good comparison between them check out the following link: Officejets with Airprint Comparison
Don't forgot to say thanks by giving "Kudos" to those that help solve your problems.
When a solution is found please mark the post that solves your issue.

TS3048 Can you buy a replacement for the little battery cover on the left side of the wireless mouse?

Can you buy a replacement for the little battery cover on the left side of a wireless keyboard?

Did you try a Google search for one: battery cover for Apple wireless keyboard
OT

Replacement for the comma key?

Similar Messages

Maybe you are looking for