Question

自2012年以来，Corrgram文档一直存在误导，正如电子邮件主题how to change variable names in corrgram diagonal中所讨论的那样，关于在对角线上放置标签。许多用户错误地认为diag.panel=...是解决方案，但它不是如下所示，但我不能使用labels，因为它尚未记录

是的，论证“标签”它的工作正常！

如果使用已经实现的功能
更新文档，那将会很棒

代码

library("corrgram")

ages <- seq(1,18)

corrgram(baseball,
  diag.labels=ages)

输出

有50个或更多警告（使用警告（）查看前50个

图。 1对角线上没有通缉标签的当前输出

R：3.3.1
操作系统：Debian 8.5

Answer 1

解决方案

 /**
 * 
 */
package data_structures;

import com.sun.corba.se.impl.orbutil.graph.Node;

/**
 * The ListNode<value_type> is a helper class for your 
 * LinkedList<value_type> class.  As its not intended for use
 * outside the LinkeList class, we are keeping it simple -- the
 * two properties will be access directly, instead of going through
 * inspectors and mutators.
 * 
 * DO NOT MODIFY THIST CLASS.
 * 
 * @param <value_type>  The type of object to be stored in the list.
 */
class ListNode<value_type> {
    public value_type value;
    public ListNode<value_type> next;

    public ListNode(value_type v) {
        value = v;
        next = null;
    }

    public ListNode(value_type v, ListNode<value_type> n) {
        value = v;
        next = n;
    }

}


/*
 * We will implement this as a single linked list.
 */
public class LinkedList<value_type> extends Sequence<value_type> {

    /**
     * head will be the first node of the list -- or null if the list is empty
     */
    private ListNode<value_type> head, tail;                      

    /**
     * List constructor: must call the superclass constructor.
     */
    public LinkedList() {
        super();
        head = null; 
        tail = null;
    }

    /* (non-Javadoc)
     * @see data_structures.Sequence#get(int)
     */
    @Override
    public value_type get(int i) {
        if (i < 0 || i >= size())
            throw new IndexOutOfBoundsException();


        ListNode<value_type> tmp = head;
        if (i==0) {
            return head.value;
        } else {
            for (int k=0; k < i; k++) {
                tmp = tmp.next;
            }
        }


        return tmp.value;
    }

    /* (non-Javadoc)
     * @see data_structures.Sequence#set(int, java.lang.String)
     */
    @Override
    public value_type set(int i, value_type value) {
        System.out.println(n);
        if (i < 0 || i >= size())
            throw new IndexOutOfBoundsException();

        if (i==0) {
            value_type s = head.value;
            head.value = value;
            return s;
        } else {
            ListNode<value_type> tmp = head;
            for (int k=0; k < i; k++) {
                tmp = tmp.next;
            }
            value_type s = tmp.value;
            tmp.value = value;
            return s;
        }
    }

    /* (non-Javadoc)
     * @see data_structures.Sequence#add(int, java.lang.String)
     */
    @Override
    public void add(int i, value_type value) {
        if (i < 0 || i > size())
            throw new IndexOutOfBoundsException();

        if (n==0) {
            head = new ListNode<value_type>(value, head);
            tail = head;
        } else if (i==0) {
            ListNode<value_type> u = new ListNode<value_type>(value, head);
            head = u;
        } else if (i==n) {
            ListNode<value_type> u = new ListNode<value_type>(value);
            tail.next = u;
            tail = u;           
        } else {
            ListNode<value_type> tmp;
            tmp = head;
            for(int k=0; k < i-1; k++) {
                tmp = tmp.next;
            }
            ListNode<value_type> u = new ListNode<value_type>(value, tmp.next);
            tmp.next = u;
        }

        n++;

    }

    /* (non-Javadoc)
     * @see data_structures.Sequence#remove(int)
     */
    @Override
    public value_type remove(int i) {
        if (i < 0 || i >= size())
            throw new IndexOutOfBoundsException();

        ListNode<value_type> tmp = head;
        if (i==0) {
            if (n==1) {
                head.next = null;
                n--;
                return head.value;
            } else {
                value_type save = head.value;
                head = head.next;
                n--;
                return save;
            }
        }
        for (int k=0; k < i-1; k++) {
            tmp = tmp.next;
        }

        ListNode<value_type> a = tmp;
        value_type save = tmp.next.value;
        ListNode<value_type> b = tmp.next.next;
        a.next = b;

        n--;

        return save;
    }

    /* (non-Javadoc)
     * @see data_structures.Sequence#clear()
     */
    @Override
    public void clear() {
        head = null;
        n = 0;
        tail=null;
    }



}

输出

如何在R Corrgram中使用对角线标签？

1 个答案: