3 ms·

I'm working on seeding `backcompat` as a portmanteau of "backwards compatibility". Help me out, HN.

• layer8 5y ago
  I‘d go for backpat. ;)
  • dmurray 5y ago
    Or ytilibitapmoc.
    • shoo 5y ago
      arguably that assumes that the operator that each letter denotes is self inverse. in the general case, y⁻¹ t⁻¹ i⁻¹ l⁻¹ i⁻¹ b⁻¹ i⁻¹ t⁻¹ a⁻¹ p⁻¹ m⁻¹ o⁻¹ c⁻¹
• kimixa 5y ago
  I'm not sure how much seeding is needed - I've heard it used for years, and seems to have become a bit of a term for the Xbox previous generation game compatibility stuff.
• hluska 5y ago
  I have a meeting with a couple of junior devs in about an hour. I'll use it in conversation and we'll see what happens. :)
• kelnos 5y ago
  I've seen and used that term for at least a decade. I don't think it needs seeding.
• robocat 5y ago
  For example quirks mode in Internet Explorer: https://developer.mozilla.org/en-US/docs/Web/API/Document/compatMode https://developer.mozilla.org/en-US/docs/Web/API/Document/co... if (document.compatMode == "BackCompat") { // in Quirks mode }
  • markstos 5y ago
    That’s using backcompat in source code, like “CompatMode”. Thankfully dictionaries aren’t full of all the variable names that exist in source code.