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?

If human space travel is limited by the G force vulnerability, is there a way to counter G forces?

Codimension of non-flat locus

Was any UN Security Council vote triple-vetoed?

Why does Kotter return in Welcome Back Kotter?

RSA: Danger of using p to create q

Is it unprofessional to ask if a job posting on GlassDoor is real?

Does detail obscure or enhance action?

Horror movie about a virus at the prom; beginning and end are stylized as a cartoon

Could an aircraft fly or hover using only jets of compressed air?

Is it inappropriate for a student to attend their mentor's dissertation defense?

Can a vampire attack twice with their claws using Multiattack?

How does one intimidate enemies without having the capacity for violence?

What does "Puller Prush Person" mean?

dbcc cleantable batch size explanation

Important Resources for Dark Age Civilizations?

Can I make popcorn with any corn?

Replacing matching entries in one column of a file by another column from a different file

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

What typically incentivizes a professor to change jobs to a lower ranking university?

Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?

Why can't we play rap on piano?

Can a monk's single staff be considered dual wielded, as per the Dual Wielder feat?

Do I have a twin with permutated remainders?

Modeling an IP Address



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.6k1934




14.6k1934












  • 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

How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye