Leaning Stack, Tilted Stack

Can someone explain the logic behind the tilted or leaning Stack? Does anyone like the leaning stack? I think I understand what it is intended to represent but in reality it doesn't really come off as that. It looks "broken", like an unorganized stack or a too big stack ready to fall over - it says "Problem" - not "cute, creative, innovative" - despite the fact that I know it is an intentional effect. Reality is that - most things that lean, people fix or they have a desire to fix - Even a stack of paper or documents. I like Apple's thoughtfulness on most things but this - "not so much". Here is the real reason for the post, what do you do if you have full dock and your stack leans right off the page and you can't really see the top of the stack? Apple fix this. Recommendation to Apple - Straighten the stack and keep in mind its ok to not use all of the capabilities/"flexibility" that your operating system gives you (ala - transparent Menu Bar .
Message was edited by: Michael McLennan

I can only echo your sentiment. It's silly to have the stack running off the right edge.
I have a fairly loaded dock and this makes it difficult to get at the items in the corners without activating Expose.
Even viewing the folder as a grid means that maybe a tenth of the window is off the right edge, that is if you move the pointer into the stack window. When one clicks a stack it should open detached from the screen edge.
I thought maybe it could be nice to put the Utility folder down there, but then it only shows about half of my utilities. So I don't really see a use for it unless it becomes a complete file browser.
It probably would make more sense if one had a main dock on the bottom and then docks on the side to use for stacks.
I'll have to see if there can be multiple docks and then test it.
As it is works right now it's driving me crazy.

Similar Messages

  • What is (Stack) in "(Stack)super.clone()"?

    hi. There's this code from the java tutorial (in the topic "Being a Descendent of Object"):
    protected Object clone() {
            try {
                Stack s = (Stack)super.clone();     // clone the stack   ---->look here
                s.items = (Vector)items.clone();     // clone the vector   -----> look here
                return s;                    // return the clone
            } catch (CloneNotSupportedException e) {
                // this shouldn't happen because Stack is Cloneable
                throw new InternalError();
    }I'd like to know what "(Stack)" and "(Vector)" stand for.

    they are casts.
    http://java.sun.com/developer/onlineTraining/new2java/supplements/2002/mar02.html#1

  • ABAP and JAVA Stack ( Double Stack ) doesn't work with TDMS 3.0 correct ?

    Hi all
    I was in Walldorf and spoke with some Basis SAP persons and they told me that a "old"   "Double Stack" SAP couldn't transfer with TDMS. Is these answer correct and if its yes on which Guide i could read these ?
    Thanks for help
    SAPERLE

    Hi,
    here it is :
    TDMS shell creation
    Regards,
    Eddy

  • Stacks not stacked?

    Hi -
    I recently upgraded to 10.5.7
    When I click on either of the preset stack folders, then only show up in what I assume is "folder," no matter how I set the preference.
    Any ideas? Am I missing something? I'm not sure I want to use the actual stack option, but it should be working...
    Ron

    If you are looking for the Fan display, that is what you need to select.
    Also note that the Fan display is not available if the Dock is on the Side of the screen.

  • Business Graphics - Stacked Column - Stack with different colours

    Hello Experts,
    In the Webdynpro application, I'm using a business graphics UI element and displaying data in stacked columns. The color of the stacks are by default assigned by the framework. But I would like to change the color of the stacks and want to assign my own colors to each stacks. Is this possible in SAP Netweaver 7.1?
    Thanks and Regards,
    Saravanan

    Hi saraa,
    Go to EDIT CUSTOMIZING to change colors etc..
    Please go through this..
    http://www.sdn.sap.com/irj/scn/go/portal/prtroot/docs/library/uuid/ca932ebc-0901-0010-68a0-b4dd81a4bf81?quicklink=index&overridelayout=true
    also read this...http://help.sap.com/saphelp_nw04s/helpdata/en/ed/258841a79f1609e10000000a155106/content.htm
    Cheers,
    Kris.
    Edited by: kissnas on Apr 12, 2011 11:06 AM

  • Stacks within stacks?

    Not so much a question... but why isn't this a feature?
    Many times I route a handful of things into a bus (or track stack) only to end up routing that bus and maybe a few other into a semi'master' bus.
    It would be awesome if I could have that master bus operate as a track stack in my environment with the 'open/close' function.  Yes, I can make that master bus into a track but I can't even take multiple busses and condense them in my environment window.  Or can I with folders or something?
    Regardless... I dont want folders!
    Just a thought!

    Use the feedback form to request such a feature....
    https://www.apple.com/feedback/logic-pro.html

  • 3850 Stack and Stack Priority

    Hi,
    Question regarding a Cisco 3850 & Stack .
    I´ve two 3850 switches stacked.
    sh switch
    Switch/Stack Mac Address : c025.5cb9.1b80 - Local Mac Address
    Mac persistency wait time: Indefinite
                                                 H/W   Current
    Switch#   Role    Mac Address     Priority Version  State
    *1       Active   c025.5cb9.1b80     1      J0      Ready
    2       Standby  c025.5cb7.c480     1      J0      Ready
    Now I will change the priority from switch 1 from 1 to  15 but I can´t do this:
    (config)#switch 1 ?
      provision  Configure Switch provision / offline confi NMTSL3CORE1
    I can´t use the command : switch 1 priority  15 as exmaple . Why ?
    Thanks for help.
    Cheers

    See below :
    sh ver
    Cisco IOS Software, IOS-XE Software, Catalyst L3 Switch Software (CAT3K_CAA-UNIVERSALK9-M), Version 03.03.01SE RELEASE SOFTWARE (fc1)
    Technical Support: http://www.cisco.com/techsupport
    Copyright (c) 1986-2013 by Cisco Systems, Inc.
    Compiled Thu 05-Dec-13 10:15 by prod_rel_team
    ROM: IOS-XE ROMMON
    BOOTLDR: CAT3K_CAA Boot Loader (CAT3K_CAA-HBOOT-M) Version 1.2, RELEASE SOFTWARE (P)
    NMTSL3CORE1 uptime is 2 hours, 57 minutes
    Uptime for this control processor is 2 hours, 59 minutes
    System returned to ROM by reload at 11:53:48 CET Mon Dec 16 2013
    System image file is "flash:packages.conf"
    Last reload reason: reload
    This product contains cryptographic features and is subject to United
    States and local country laws governing import, export, transfer and
    use. Delivery of Cisco cryptographic products does not imply
    third-party authority to import, export, distribute or use encryption.
    Importers, exporters, distributors and users are responsible for
    compliance with U.S. and local country laws. By using this product you
    agree to comply with applicable laws and regulations. If you are unable
    to comply with U.S. and local laws, return this product immediately.
    A summary of U.S. laws governing Cisco cryptographic products may be found at:
    http://www.cisco.com/wwl/export/crypto/tool/stqrg.html
    If you require further assistance please contact us by sending email to
    [email protected].
    License Level: Ipbase
    License Type: Permanent
    Next reload license Level: Ipbase
    cisco WS-C3850-24P (MIPS) processor with 4194304K bytes of physical memory.
    Processor board ID FOC1737X0T4
    4 Virtual Ethernet interfaces
    56 Gigabit Ethernet interfaces
    8 Ten Gigabit Ethernet interfaces
    2048K bytes of non-volatile configuration memory.
    4194304K bytes of physical memory.
    250456K bytes of Crash Files at crashinfo:.
    250456K bytes of Crash Files at crashinfo-2:.
    1609272K bytes of Flash at flash:.
    1609272K bytes of Flash at flash-2:.
    0K bytes of Dummy USB Flash at usbflash0:.
    0K bytes of Dummy USB Flash at usbflash0-2:.
    0K bytes of  at webui:.
    Base Ethernet MAC Address          : c0:25:5c:b9:1b:80
    Model Revision Number              : J0
    Motherboard Revision Number        : C0
    Model Number                       : WS-C3850-24P
    Switch Ports Model              SW Version        SW Image              Mode
    *    1 32    WS-C3850-24P       03.03.01SE        cat3k_caa-universalk9 INSTALL
         2 32    WS-C3850-24P       03.03.01SE        cat3k_caa-universalk9 INSTALL
    Switch 02
    Switch uptime                      : 58 minutes
    Base Ethernet MAC Address          : c0:25:5c:b7:c4:80
    Model Revision Number              : J0
    Motherboard Revision Number        : C0
    Model Number                       : WS-C3850-24P
    Configuration register is 0x102
    Cheers

  • Stacks vs stacks?

    Maybe this is obvious to everybody else, but I never noticed it before: I stack two images that originated as different shots. Then I make a Duplicate Version of one of them and do stuff to it. Now they're all three in a stack -- but the new version and its original are in a substack that can't be broken up.
    If I try to order them as new version of shot 1, shot 2, old version of shot 1, there seems to be no way to do it. (I tried unstacking them all and restacking; the linked pair join up again.)
    I've often thought that Stacks were really for two different purposes: grouping versions of a shot, and grouping shots that seem related on some more general level. Now it looks as though Aperture *sort of* thinks that way. Is there a Feature Request lurking in here somewhere?

    Starting with PSE 6, Adobe changed the way stacks interact with version sets and albums.  The core issue is that Adobe intended stacks to be used in a way different than you are using them.
    In Adobe's design, stacks are similar to version sets and are intended for grouping similar versions of the same scene, where there is one “best” photo on the top of the stack. The PSE User Guide gives the following examples: “For example, create a stack to group together multiple photos of your family taken with the same pose; or, for example, photos taken at a sports event using your camera’s burst mode or auto-bracket feature.”   Some people try to use stacks instead of keyword tags to group disparate photos of the same subject (e.g. ten different photos of a wedding), and the stacks end up having many “best” photos buried inside the stack, with the photos having different keyword tags.
    Unfortunately, using stacks this way interacts badly with the Organizer’s search – if any photo inside a stack matches the search, all the photos in the stack are displayed in the search results, regardless of whether they match.  And as you've discovered, it makes using the stacks with albums more difficult.   The underlying problem is that the stacks contain more than one "best" photo -- they contain multiple photos that you may want to use in different situations.
    I'm not at all saying what you're doing is "wrong", just explaining how what you want to do differs from Adobe's intended uses.  People have been complaining about this since PSE 6 came out, and given that Adobe puts almost no effort into the Organizer anymore, I think it's unlikely it will change.

  • Dual Stack NW 7.0 installation with R/3 Backend as UME

    I have a quick question guys. I am about to install a dual stack NW system with ADS(SQL server database on windows) and will use a R/3 Enterprise running on unix as the UME datasource. Now this R/3 enterprise backend already acts as bakend for Portal system and uses sap logon tickets and as such already has the user SAPJSF.   Now when i actually perform the NW 7.0 installation and enter a master password during the course, would this override the SAPJSF user in R/3 backend system at all.
    What are the general problems that are caused with using an existing ABAP only system as the UME for your Java stack(Dual stack actually) systems. Can you advise.
    Regards
    Kalyan

    Hi,
    Now when i actually perform the NW 7.0 installation and enter a master password during the course,
    would this override the SAPJSF user in R/3 backend system at all.
    NO....Not at all..
    SAPJSF user is used for the communication between ABAP  and JAVA stacks. SAPJSF user is an independent user of each independent ABAP stack.
    ABAP data/user-store is the place where the users, roles and authorizations of an ABAP System are stored.
    And with the same concept, the UME is the same mechanism for users, roles, permissions of an JAVA system.
    After installation of your new NW ABAP+JAVA Stack, you will have to specify the SAPJSF user of ur old R/3 ABAP system which you want to use as User Data Store for ur Newly installed Java System's UME.
    In ABAP System section u will have to provide all details of ur SAP R/3 application server, which ur portal is already using as User Data Store.
    What are the general problems that are caused with using an existing ABAP only system
    as the UME for your Java stack(Dual stack actually) systems. Can you advise.
    It depends on the usage of your new application server.
    Regards
    Bhavik G. Shroff

  • How to put a single stack item to an album?

    Maybe a silly question, but I can't find out how to put a single item from a stack into an album. When I drag a stacked item to an album, the entire stack appears in the album. This is not what I want, I want to get the single item in the album.
    I know I can make a single stacked item in an album to be the albumpick. But this is not enough. Sometimes I need to put two items from the same stack into this album.
    Koen
    Message was edited by: Koen van Dijken

    Koen van Dijken wrote:
    Would this be as designed, and so a wrong use of stacks by me?
    It is as designed but I don't think what you want to do is a particularly wrong use of stacks. I can see using stacks as a way to reduce clutter in the browser but still wanting to be able to get to individual images in the stack to use..
    What is interesting is the wording in the Aperture users guide concerning stacks:
    Dragging Stacks
    You can drag an entire stack to a new location, *and you can drag specific images within a stack to a new location*. When a stack is closed, dragging the stack moves the entire stack. *When a stack is open, you can drag individual images to new locations in the Browser*. You can also drag images into a stack. If you drag an image within a stack into a different project, however, the entire stack moves to the new location.
    (emphasis added)
    So the first part sounds like you should be able to drag an image out of the stack to an album, the second just mentions dragging an image out of the stack in the browser.
    And in way you can do this, the only thing is what you end up doing is unstacking the image you drag out. Not exactly what you would want to do.
    I think it should be OK to place individual stack items into albums and have them remain in the stack. Any reason this would be a bad idea?

  • Abap+java stack for Portal 7.0 and MI - User Data Source

    The SAP pre-requisites for Portal and MI (Mobile Infrastructure) 7.0 is an ABAP and Java Stack. If you install an AS ABAP + Java, the UME is automatically set up to use the ABAP user management of the same AS installation. What does this mean? The user store will be created in ABAP, for both the Portal and MI.
    The impact of this is portal users management is in ABAP. This configuration by design cannot be connected to LDAP Active directory for user authentication.
    Please let me know , if some body had already face similar issue and come up with the solution.  Thanks in advance.

    Hi Surya ,
    When you install portal or any NW component with ABAP stack , ABAP stack hold precidence over the JAVA Stack , refer to this link to have more idea on this .
    http://help.sap.com/saphelp_nw2004s/helpdata/en/2b/306bb5bc98f24f8a85d489449af456/frameset.htm--
    http://help.sap.com/saphelp_nw04s/helpdata/en/12/7678123c96814bada2c8632d825443/frameset.htm
    Thanx
    Pankaj

  • Problem with queues / stacks for a project

    I have to code a calculator that turns an infix expression, where the operator is in the middle, to a postfix expression, where the operators are at the end;
    so, for instance, 5 + 5 would really be 5 5 +, and 5 + 5 * 5 / 5 would be 5 5 5 5 + * /.
    I've gotten the addition and subtraction working fine, the only problem comes when I have to take into account order of operations (so far).
    So, that being said, here is the code:
    import java.util.*;
    public class iCalc {
          * @param args
         public static void main(String[] args) {
         //     Scanner scan = new Scanner(System.in);
         //     System.out.println("Equation:");
         //     String input = "55+5-10%16."; //might have to store each element in a linked list later
         //     evalExp(input);     //calls evalExp with the input
              String input2 = "55 + 5 * 10 + 16";//declare some dummy input
              //121
              String [] items = input2.split(" ");//split the string's elements into an array
              Queue<String> queue = new LinkedList<String>();//the queue
              Stack<String> stack = new Stack<String>();//make a new stack to store operators
              Stack<String> stackOutput = new Stack<String>();//output stack
              for (String s : items) {//scan the array
                  System.out.println("item : " + s);//print out what's being scanned
                  if(isNumber(s)) queue.add(s);//add it onto the queue
                  if(isOperator(s)) stack.push(s);//add it onto the stack
              //converts to postfix here
             while(!stack.isEmpty()) queue.add(stack.pop());
             evalExp(queue, stackOutput);
         public static void evalExp(Queue<String> exp, Stack<String> outputStack)
              System.out.println("Evaluating the expression...");
              int length = exp.size();
              int temp;
         while(length > 0)
              // 55 5 10 16 + * +
              // 55
              try{
                   length--;
                   System.out.println("Trying to see if the element is a number...");
                   if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                        int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                        temp = 0;
                        for(String s : exp)
                        {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                             temp++;//keeps track of how far you are into the queue
                             outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                             if(temp == spot+1)
                                  break;     //(if there were enough elements in the queue popped, end this loop
                        outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
                   Double MyNum = Double.parseDouble(exp.remove());
                   String MyStackNum = "" + MyNum;
                   outputStack.push(MyStackNum);
                        if(outputStack.size() == 2)
                             length--;
                             String operator = popTheOperator(exp);
                             System.out.println("Two numbers have been popped, time to find the operator...");     
                             outputStack.push(performMath(outputStack.pop(), outputStack.pop(), operator));
                             for(String s : exp)
                                  if(s.equals(operator))
                                       exp.remove(s);
                                       break;
              }     catch(Exception ParseException){
                   outputStack.push(performMath(outputStack.pop(), outputStack.pop(), exp.remove()));               
              while(!outputStack.isEmpty()) System.out.println("The output stack is:" + outputStack.pop());     
         public static boolean isNumber(String s1)
              char[]arr2 = s1.toCharArray();
              for(int i = 0;i<s1.length();i++)
                   System.out.println("checking...." + s1);
                   if((!Character.isDigit(arr2))) return false;
              return true;
         public static boolean isOperator(String s2)
              char[]arr3 = s2.toCharArray();
              for(int i = 0;i<arr3.length;i++)
                   System.out.println("checking...." + arr3[i]);
                   if(findOperator(arr3[i])) return true;
              return false;
         public static boolean findOperator(char op)
                        if(op == '+' ||
                             op == '-' ||
                             op == '/' ||
                             op == '*' ||
                             op == '%' ||
                             op == '^' ||
                             op == '&' ||
                             op == '(' ||
                             op == ')' ||
                             op == '|' ||
                             op == '>' ||
                             op == '<' ||
                             op == '=' ||
                             op == '!' ) return true;          
              return false;          
         // 10 16 + + +
         public static String popTheOperator(Queue<String> myQueue)
              String current = "";
              for(String s: myQueue)
                   if(s.equals("*") || s.equals("/"))
                        current = s;
                   break;
              if(current == "")
                   for(String s: myQueue)
                        if(s.equals("+") || s.equals("-"))
                             current = s;
                             break;
         return current;     
         public static String performMath(String operand1, String operand2, String operator)
              String myString = "";
              double result = 0;
              double temp1 = Double.parseDouble(operand1);
              double temp2 = Double.parseDouble(operand2);
              if(operator.equals("+"))
                   result = temp1 + temp2;
              else if(operator.equals("-"))
                   result = temp2 - temp1;
              else if(operator.equals("/"))
                   result = temp1 / temp2;
              else if(operator.equals("*"))
                   result = temp1 * temp2;
              else if(operator.equals("%"))
                   result = temp1 % temp2;
              else if(operator.equals("^"))
                   result = Math.pow(temp1, temp2);
              else if(operator.equals("&"))
              else if(operator.equals("|"))
                   result = temp1 - temp2;
              else if(operator.equals(">"))
                   if(temp1 > temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("<"))
                   if(temp1 < temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("="))
                   if(temp1 == temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("!"))
                   if(temp1 != temp2) result = 1;
                   else result = 0;
              myString = "" + result;
              return myString;
         public static boolean isMultiplyOrDivide(Queue<String> myQueue)
              for(String s : myQueue)//scan the queue
                   if(s.equals("*") || s.equals("/"))
                        return true;//it has found a multiply/divide operator!
              return false;
         public static int findMultiplyOrDividePosition(Queue<String> myQueue)
              int position = 0;
              for(String s: myQueue)
                   if(s.equals("+") ||
                                  s.equals("-") ||
                                  s.equals("%") ||
                                  s.equals("^") ||
                                  s.equals("&") ||
                                  s.equals("|") ||
                                  s.equals(">") ||
                                  s.equals("<") ||
                                  s.equals("=") ||
                                  s.equals("!")) position ++;
              return position;
    }I think that its trying to remove the head, but because the head was already removed, somehow its not letting it remove it; as if by removing the head, there is no new updated head.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

                   if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                        int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                        temp = 0;
                        for(String s : exp)
                        {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                             temp++;//keeps track of how far you are into the queue
                             outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                             if(temp == spot+1)
                                  break;     //(if there were enough elements in the queue popped, end this loop
                        outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
                   }the problem is somewhere in here.

  • Problem with Exporting/Stacking in Lightroom 5.2

    I have used stacks in Lightroom for a long time but I am now having a problem. My typical workflow is to process RAW images in the Develop Module then Export them as JPG files. I choose "export to same folder as original" and I check "add to this catalogue" and "add to stack above original". Until recently this has worked well - the RAW and JPG files appeared as a stack in the catalogue. Now, when I go back to Library I do not see the JPG files in the catalogue and there are no stacks being created. (I can see that the JPG files are appearing in the same folder as the original RAW files as I intend them to do.)
    An additional observation is that stacks that were previouly created are not behaving normally. When I split a stack, the stack status is compleley lost - the number in the upper left corners are gone.
    How can I fix these problems?

    If you're a beginner this might be helpful.
    Capture Sharpening
    Make sure you are using LR's 1:1 Zoom view when adjusting Sharpening and Noise Reduction. A Sharpening Amount in the range of 25 to 50 with the default 1.0 Radius and 25 Detail works well with most "normal" images. Adobe increased the Sharpening Amount from 100 to 150 to provide additional sharpening when using high Mask settings. You shouldn't need to set the Amount higher than 100 when Masking = 0. Even with Masking I've never required Sharpening Amount higher than about 75.
    Noise Reduction
    If you have visible noise in the image after sharpening, increase the Luminance NR from the 0 default. If color noise is visible increase Color NR as well. You may then need to go back and increase Sharpening slightly–It's a trade-off of low-noise vs sharpness. This procedure is normally only required with images shot at high ISO settings. Images shot at ISO 100-400  should have minimal visible noise at 1:1 view and require very little more than the default LR settings.
    Output Sharpening & Resizing
    With today's high-megapixel cameras full-size Exports are not required for most purposes and simply create larger file sizes. When resizing images during Export it is important to add 'Output Sharpening' to match the target usage (prints or screen viewing). This has much more effect on the resized file's image sharpness than LR 'Capture Sharpening' used alone. If you do Export images full-size for use in other applications Output Sharpening is normally not required.
    Cheers,
    Todd

  • Help! - Stacked canvases disappear

    Using Forms 6.05. Have content canvas with 2 stacked canvases which I want visible at all times. Have 2 large data blocks requiring horizontal scrollbars on the stacked canvases. Have put the identifier column from each of the data blocks on the content canvas so they remain static and visible while the user scrolls horizontally thru the remainder of the data blocks. Have also put the vertical scrollbars for the data blocks on the content canvas so they too remain static and visible when scrolling horizontally. PROBLEM: When content canvas 1st displays, stacked canvases are visible and data blocks are populated. If the first user action is to manipulate the scrollbar, the stacked canvases disappear. However, if the user clicks on a data block item first and then manipulates the scrollbar, the stacked canvases remain visible. HELP! I can't figure out what is happening and how to fix it. Any info is appreciated.

    The canvases have to be ordered in the Forms definition in the order they overlap each other on the screen, i.e. content canvas, stacked canvas, stacked canvas.
    Use show_view and immideatelly go_block built ins, where the block is a block from the stacked canvas.
    The items shown on the stacked canvases have to be separated in different blocks, where you have to declare the scrolbares.
    Joseph
    null

  • Load files to stack with out file extention as part of layer name

    Ok so as the title says i'm trying to figure out how to modify the "Load Files to Stack..." script so that it doesn't put the file extention as part of the layer name. it makes it a pain to have to go through and remove it when dealing with a lot of layers. I'm using photoshop CS5 on Win 7.
    Also if possible a script that would make Comp Layers for each layer created when loading files to stack it's a bit much to ask but worth a shot

    If anyone is just looking to import files into stack without extension names here's what I did:
    1- Go to your adobe scripts folder:
    64 bit - C:\Program Files\Adobe\Adobe Photoshop CS6 (64 Bit)\Presets\Scripts\
    32 bit - C:\Program Files (x86)\Adobe\Adobe Photoshop CS6\Presets\Scripts\
    2 - Copy and paste these 2 files somewhere other than in the adobe folder like the desktop (I had to due to permission restrictions when saving):
    Load Files into Stack.jsx
    Stack Scripts Only\CreateImageStack.jsx
    3 - Rename these files to
    Load Files into Stack - no ext.jsx
    CreateImageStack_noext.jsx
    4 - edit Load Files into Stack - no ext.jsx (I use notepad++) and save
    Line 16 - <name> Load Files into Stack (no extension) </name>
    Line 43 - $.evalFile(g_StackScriptFolderPath + "CreateImageStack_noext.jsx");
    5 - edit CreateImageStack_noext.jsx, insert this line into "line 411" (just above "app.activeDocument.activeLayer.name = this.fName;") and save
    Line 411 - this.fName = this.fName.replace(/(?:\.[^.]*$|$)/, '');
    6 - copy and paste these edited files back into your adobe ...\Presets\Scripts\ folder (overwrite folder), reload photoshop and you should now see in File > Scripts > Load Files into Stack (no extension) available!
    And for the lazy, here are the two files
    load_files_into_stack_no_ext.zip
    drop these in your photoshop scripts folder:
    64 bit - C:\Program Files\Adobe\Adobe Photoshop CS6 (64 Bit)\Presets\Scripts\
    32 bit - C:\Program Files (x86)\Adobe\Adobe Photoshop CS6\Presets\Scripts\
    Hopefully this helps someone! Why adobe just doesn't have this as the default is beyond me.

Maybe you are looking for

  • Custom Alert Email Templates Issue - List Alerts emails not using customized XML alert template

    I have recently customized the XML alerts template (AlertTemplates.xml) for our site collection in SharePoint 2010 to exclude specific fields in the email when users who have subscribed to a list using the "Alert Me" feature.  I have renamed the cust

  • Find User Exit in MIR7 to validate Vendor info

    When incoming invoice is being “parked” in transaction MIR7, I need to find user exit to add validation/warning if vendor has multiple PI partners in the vendor master. It has to happen when user types in PO number and hits enter key – this is when v

  • Updating of TestStand data from CVI Callback

    How do I update the variables in TestStand from a callback function in LabWindows. In the attached file the use must press the pass or fail button. This action is received in the callback function in CVI where I call the TS_PropertySetValBoolean meth

  • My music page will not show when clicked on?

    Hi im having difficulty to get my ipod to load my music page when clicked on and dont know what to do to fix it? I was wondering if someone would be able to help me.

  • NWDI Configuration: CMS

    hi, We are trying to configure NWDI and in this process, we had completed all the steps for NWDI installation and configuration and also the CMS configuration, Product & SC Definition in SLD now during the creation of Tracks using CMS, we are not abl