Merge org tablesTOC of tables for org-mode long tablesCreate table for existing data using org-modeCan org tables cooperate with my customized dates?Is there a python tool for parsing org-mode tables?Auto-update org tables before each exportHow to export org tables with cells on multiple lines?Controling what an org-link points to with variablesConditional evaluation of org mode tables?Number-separators in org-mode tablesOrg-Mode How to position tables correctly when exporting to Latex?

Using parameter substitution on a Bash array

Where in the Bible does the greeting ("Dominus Vobiscum") used at Mass come from?

How to be diplomatic in refusing to write code that breaches the privacy of our users

Is it correct to write "is not focus on"?

Was the picture area of a CRT a parallelogram (instead of a true rectangle)?

Ways to speed up user implemented RK4

Teaching indefinite integrals that require special-casing

How do I define a right arrow with bar in LaTeX?

Why does John Bercow say “unlock” after reading out the results of a vote?

Student evaluations of teaching assistants

What's the purpose of "true" in bash "if sudo true; then"

Everything Bob says is false. How does he get people to trust him?

Time travel short story where a man arrives in the late 19th century in a time machine and then sends the machine back into the past

Are there any comparative studies done between Ashtavakra Gita and Buddhim?

Generic lambda vs generic function give different behaviour

Coordinate position not precise

Is there an Impartial Brexit Deal comparison site?

What is the oldest known work of fiction?

How will losing mobility of one hand affect my career as a programmer?

Lay out the Carpet

Displaying the order of the columns of a table

What would happen if the UK refused to take part in EU Parliamentary elections?

What is the term when two people sing in harmony, but they aren't singing the same notes?

Why Were Madagascar and New Zealand Discovered So Late?



Merge org tables


TOC of tables for org-mode long tablesCreate table for existing data using org-modeCan org tables cooperate with my customized dates?Is there a python tool for parsing org-mode tables?Auto-update org tables before each exportHow to export org tables with cells on multiple lines?Controling what an org-link points to with variablesConditional evaluation of org mode tables?Number-separators in org-mode tablesOrg-Mode How to position tables correctly when exporting to Latex?













2















Let's say I have the following org-tables:



| col1 | col2 |
| 1 | 2 |


| col3 |
| 3 |


What's the easiest programmatic way to get the following output:



| col1 | col2 | col3 |
| 1 | 2 | 3 |









share|improve this question
























  • Manually or programmatically?

    – choroba
    Mar 21 at 15:36











  • Programmatically.

    – андрэ
    Mar 21 at 15:47















2















Let's say I have the following org-tables:



| col1 | col2 |
| 1 | 2 |


| col3 |
| 3 |


What's the easiest programmatic way to get the following output:



| col1 | col2 | col3 |
| 1 | 2 | 3 |









share|improve this question
























  • Manually or programmatically?

    – choroba
    Mar 21 at 15:36











  • Programmatically.

    – андрэ
    Mar 21 at 15:47













2












2








2


1






Let's say I have the following org-tables:



| col1 | col2 |
| 1 | 2 |


| col3 |
| 3 |


What's the easiest programmatic way to get the following output:



| col1 | col2 | col3 |
| 1 | 2 | 3 |









share|improve this question
















Let's say I have the following org-tables:



| col1 | col2 |
| 1 | 2 |


| col3 |
| 3 |


What's the easiest programmatic way to get the following output:



| col1 | col2 | col3 |
| 1 | 2 | 3 |






org-mode






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Mar 21 at 16:25







андрэ

















asked Mar 21 at 15:32









андрэандрэ

1275




1275












  • Manually or programmatically?

    – choroba
    Mar 21 at 15:36











  • Programmatically.

    – андрэ
    Mar 21 at 15:47

















  • Manually or programmatically?

    – choroba
    Mar 21 at 15:36











  • Programmatically.

    – андрэ
    Mar 21 at 15:47
















Manually or programmatically?

– choroba
Mar 21 at 15:36





Manually or programmatically?

– choroba
Mar 21 at 15:36













Programmatically.

– андрэ
Mar 21 at 15:47





Programmatically.

– андрэ
Mar 21 at 15:47










1 Answer
1






active

oldest

votes


















7














You can use cl-mapcar.



#+NAME: T1
| col1 | col2 |
| 1 | 2 |

#+NAME: T2
| col3 |
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 1 | 2 | 3 |


A nice side-effect of that solution is that it does not hurt if one table stops early. The resulting table is just as long as the shortest input table.



#+NAME: T1
| col1 | col2 |
| 11 | 12 |
| 21 | 22 |
| 31 | 32 |

#+NAME: T2
| col3 |
| 13 |
| 12 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 11 | 12 | 13 |
| 21 | 22 | 12 |


If you have actually headers you can use:



#+NAME: T1
| col1 | col2 |
|------+------|
| 1 | 2 |

#+NAME: T2
| col3 |
|------|
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(insert-at 1 (cl-mapcar #'append t1 t2) 'hline)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
|------+------+------|
| 1 | 2 | 3 |


Thereby, insert-at is defined by:



(defun insert-at (n list element)
"Insert ELEMENT into LIST at position N.
I.e., (eq ELEMENT (nth N (insert-at N LIST ELEMENT)))."
(if (eq n 0)
(cons element list)
(let ((link (nthcdr (1- n) list)))
(setcdr link (cons element (cdr link))))
list))





share|improve this answer

























  • That's... lovely!

    – андрэ
    Mar 21 at 16:39






  • 1





    Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

    – Tobias
    Mar 21 at 16:53










Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "583"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2femacs.stackexchange.com%2fquestions%2f48508%2fmerge-org-tables%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









7














You can use cl-mapcar.



#+NAME: T1
| col1 | col2 |
| 1 | 2 |

#+NAME: T2
| col3 |
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 1 | 2 | 3 |


A nice side-effect of that solution is that it does not hurt if one table stops early. The resulting table is just as long as the shortest input table.



#+NAME: T1
| col1 | col2 |
| 11 | 12 |
| 21 | 22 |
| 31 | 32 |

#+NAME: T2
| col3 |
| 13 |
| 12 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 11 | 12 | 13 |
| 21 | 22 | 12 |


If you have actually headers you can use:



#+NAME: T1
| col1 | col2 |
|------+------|
| 1 | 2 |

#+NAME: T2
| col3 |
|------|
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(insert-at 1 (cl-mapcar #'append t1 t2) 'hline)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
|------+------+------|
| 1 | 2 | 3 |


Thereby, insert-at is defined by:



(defun insert-at (n list element)
"Insert ELEMENT into LIST at position N.
I.e., (eq ELEMENT (nth N (insert-at N LIST ELEMENT)))."
(if (eq n 0)
(cons element list)
(let ((link (nthcdr (1- n) list)))
(setcdr link (cons element (cdr link))))
list))





share|improve this answer

























  • That's... lovely!

    – андрэ
    Mar 21 at 16:39






  • 1





    Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

    – Tobias
    Mar 21 at 16:53















7














You can use cl-mapcar.



#+NAME: T1
| col1 | col2 |
| 1 | 2 |

#+NAME: T2
| col3 |
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 1 | 2 | 3 |


A nice side-effect of that solution is that it does not hurt if one table stops early. The resulting table is just as long as the shortest input table.



#+NAME: T1
| col1 | col2 |
| 11 | 12 |
| 21 | 22 |
| 31 | 32 |

#+NAME: T2
| col3 |
| 13 |
| 12 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 11 | 12 | 13 |
| 21 | 22 | 12 |


If you have actually headers you can use:



#+NAME: T1
| col1 | col2 |
|------+------|
| 1 | 2 |

#+NAME: T2
| col3 |
|------|
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(insert-at 1 (cl-mapcar #'append t1 t2) 'hline)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
|------+------+------|
| 1 | 2 | 3 |


Thereby, insert-at is defined by:



(defun insert-at (n list element)
"Insert ELEMENT into LIST at position N.
I.e., (eq ELEMENT (nth N (insert-at N LIST ELEMENT)))."
(if (eq n 0)
(cons element list)
(let ((link (nthcdr (1- n) list)))
(setcdr link (cons element (cdr link))))
list))





share|improve this answer

























  • That's... lovely!

    – андрэ
    Mar 21 at 16:39






  • 1





    Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

    – Tobias
    Mar 21 at 16:53













7












7








7







You can use cl-mapcar.



#+NAME: T1
| col1 | col2 |
| 1 | 2 |

#+NAME: T2
| col3 |
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 1 | 2 | 3 |


A nice side-effect of that solution is that it does not hurt if one table stops early. The resulting table is just as long as the shortest input table.



#+NAME: T1
| col1 | col2 |
| 11 | 12 |
| 21 | 22 |
| 31 | 32 |

#+NAME: T2
| col3 |
| 13 |
| 12 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 11 | 12 | 13 |
| 21 | 22 | 12 |


If you have actually headers you can use:



#+NAME: T1
| col1 | col2 |
|------+------|
| 1 | 2 |

#+NAME: T2
| col3 |
|------|
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(insert-at 1 (cl-mapcar #'append t1 t2) 'hline)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
|------+------+------|
| 1 | 2 | 3 |


Thereby, insert-at is defined by:



(defun insert-at (n list element)
"Insert ELEMENT into LIST at position N.
I.e., (eq ELEMENT (nth N (insert-at N LIST ELEMENT)))."
(if (eq n 0)
(cons element list)
(let ((link (nthcdr (1- n) list)))
(setcdr link (cons element (cdr link))))
list))





share|improve this answer















You can use cl-mapcar.



#+NAME: T1
| col1 | col2 |
| 1 | 2 |

#+NAME: T2
| col3 |
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 1 | 2 | 3 |


A nice side-effect of that solution is that it does not hurt if one table stops early. The resulting table is just as long as the shortest input table.



#+NAME: T1
| col1 | col2 |
| 11 | 12 |
| 21 | 22 |
| 31 | 32 |

#+NAME: T2
| col3 |
| 13 |
| 12 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(cl-mapcar #'append t1 t2)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
| 11 | 12 | 13 |
| 21 | 22 | 12 |


If you have actually headers you can use:



#+NAME: T1
| col1 | col2 |
|------+------|
| 1 | 2 |

#+NAME: T2
| col3 |
|------|
| 3 |

#+BEGIN_SRC emacs-lisp :var t1=T1 t2=T2 :colnames no
(insert-at 1 (cl-mapcar #'append t1 t2) 'hline)
#+END_SRC

#+RESULTS:
| col1 | col2 | col3 |
|------+------+------|
| 1 | 2 | 3 |


Thereby, insert-at is defined by:



(defun insert-at (n list element)
"Insert ELEMENT into LIST at position N.
I.e., (eq ELEMENT (nth N (insert-at N LIST ELEMENT)))."
(if (eq n 0)
(cons element list)
(let ((link (nthcdr (1- n) list)))
(setcdr link (cons element (cdr link))))
list))






share|improve this answer














share|improve this answer



share|improve this answer








edited Mar 21 at 18:35

























answered Mar 21 at 16:37









TobiasTobias

14.4k1933




14.4k1933












  • That's... lovely!

    – андрэ
    Mar 21 at 16:39






  • 1





    Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

    – Tobias
    Mar 21 at 16:53

















  • That's... lovely!

    – андрэ
    Mar 21 at 16:39






  • 1





    Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

    – Tobias
    Mar 21 at 16:53
















That's... lovely!

– андрэ
Mar 21 at 16:39





That's... lovely!

– андрэ
Mar 21 at 16:39




1




1





Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

– Tobias
Mar 21 at 16:53





Uups the definition of insert-at is from my own lisp library. I'll replace it with something standard in a moment...

– Tobias
Mar 21 at 16:53

















draft saved

draft discarded
















































Thanks for contributing an answer to Emacs Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2femacs.stackexchange.com%2fquestions%2f48508%2fmerge-org-tables%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quoting Keynes in a lectureIs differentiated instruction permitted by universities?How to make students learn prerequisitesUnsatisfactory Instructor Evaluations: balancing of expectations of engineering studentsWhat is the difference between a “statistician”, “applied statistician”, and an academic applying advanced stats within their field?Listing in reference section, but not quotingHow to efficiently use time while preparing for a class?Graduate Admissions: Teaching Emphasisstrategies for sharing teaching information with universities I don't personally have contacts withIs there an efficient way to give a large class of students feedback about their assignments?Is it unreasonable to expect students to read the lecture notes before attending the first class?

Rank groups within a grouped sequence of TRUE/FALSE and NAGrouping functions (tapply, by, aggregate) and the *apply familyCharacters counting and subletting specific patternsWhat is the purpose of setting a key in data.table?data.table vs dplyr: can one do something well the other can't or does poorly?how to make a bar plot for a list of dataframes?How to group by unique values in a list in RPandas - Alternative to rank() function that gives unique ordinal ranks for a columnRank within group in for loop in RData transformation: from dyadic to observational data in RGetting map from purrr to work with paste0

Are all passive ability checks floors for active ability checks?Does passive perception supersede active perception?Which skills can be used passively?Active Opposition with Free-Form Professions in Fate5E Trap/Ambush/Stealth Mechanics VS Passive Perception ConfusionInteraction between perception and stealth in obscured conditionsHow does Keen Sight affect Passive Perception?Are all d20 rolls either attacks, saves or ability checks?Can players declare that they are making a specific ability check?Can I see a Hidden creature that is not obscured at all?Can a Stealth check ever be made passively?Is this alternate version of the Observant feat balanced?What is the minimum amount of skill points per HD?